3828 papers
V2M-Zero introduces a zero-pair video-to-music generation framework that achieves superior temporal synchronization and semantic alignment by leveraging shared intra-modal temporal structures via event curves, eliminating the need for paired training data or cross-modal supervision.
The paper introduces Neural Field Thermal Tomography (NeFTY), a differentiable physics framework that parameterizes 3D material diffusivity as a continuous neural field optimized via a rigorous numerical solver to achieve high-resolution, quantitative reconstruction of subsurface defects from transient surface temperature measurements, overcoming the limitations of traditional 1D approximations and soft-constrained PINNs.
XConv is a drop-in replacement for standard convolutional layers that significantly reduces memory usage during training by storing compressed activations and approximating weight gradients via randomized trace estimation, while maintaining performance comparable to exact gradient methods without imposing architectural constraints or requiring codebase modifications.
This survey systematically reviews decentralized federated learning methods from 2018 to early 2026, categorizing them into traditional distributed and blockchain-based architectures, proposing a unified challenge-driven taxonomy, and outlining future research directions to address security, privacy, and system-level trade-offs in coordinator-free settings.
This paper proves that randomly initialized, polynomially over-parameterized convolutional neural networks contain structured subnetworks capable of approximating smaller networks without training, by developing new mathematical tools to overcome previous limitations in analyzing the Strong Lottery Ticket Hypothesis for structured pruning.
This paper proposes a novel, theoretically grounded graph clustering method that constructs homophilic and heterophilic graphs to build low-pass and high-pass filters enhanced by a squeeze-and-excitation block, effectively addressing the limitations of existing approaches in handling the structural disparities of real-world graphs.
This paper proposes a deep learning framework that jointly discovers optimal coordinates and flow maps to enable precise, computationally efficient time-stepping for multiscale systems, achieving state-of-the-art predictive accuracy with reduced costs on complex models like the Fitzhugh-Nagumo neuron and Kuramoto-Sivashinsky equations.
This paper proposes a fairness-aware multi-group target detection approach for online discussions that effectively reduces bias across demographic groups while maintaining strong predictive performance, particularly in the context of toxicity detection where harm is highly dependent on the targeted group.
This paper proposes and evaluates a distributed multi-agent Q-learning solution for HD map updates in vehicular networks that reduces computational burdens and compatibility issues while significantly improving time latencies across various traffic scenarios compared to single-agent approaches.
This paper introduces Sparse Variational Student-t Processes (SVTP), a scalable framework that extends sparse inducing point methods to Student-t processes via novel inference algorithms and natural gradient optimization, achieving superior robustness to outliers and heavy-tailed data with significantly faster convergence and lower prediction error compared to sparse Gaussian processes on large datasets.
This paper introduces HYGENE, the first deep learning-based diffusion method that generates realistic and diverse hypergraphs by iteratively expanding a bipartite representation from a single connected node pair through a progressive local expansion process.
This paper introduces a unified framework that models quantization and sparsification as additive noise to derive a principled, noise-corrective gradient path, enabling the stable training of neural networks at arbitrary low precisions and sparsity levels without relying on heuristic estimators like the Straight-Through Estimator.
The paper introduces ARLBench, a flexible and efficient benchmark for hyperparameter optimization in reinforcement learning that utilizes a representative subset of tasks to enable cost-effective comparisons of diverse AutoRL methods and lower the barrier to entry for researchers with limited compute resources.
The paper introduces DRUPI (Dataset Condensation using Privileged Information), a framework that enhances dataset condensation by synthesizing auxiliary privileged information, such as feature or attention labels, alongside reduced data to significantly improve model training performance across various benchmarks.
This paper proposes a novel fairness-aware data repair framework that utilizes a Bayesian nonparametric stopping rule to learn robust optimal transport operators, thereby overcoming representation bias in underrepresented subgroups and enabling effective repairs on out-of-sample archival data while balancing fairness against data distortion.
This paper proposes an unsupervised representation learning framework that factorizes latent variable transformations into sparse rotational and potential flow fields, enabling the model to learn disentangled representations based on independent transformation primitives while achieving state-of-the-art performance in data likelihood and equivariance on sequence data.
This paper proposes a data-driven framework combining control barrier functions and differentiable optimization to learn interpretable responsibility allocations, enabling autonomous agents to quantify and adjust their behaviors for safe, socially-aware multi-agent interactions.
This paper proposes a novel machine learning framework that combines gradient descent on the Grassmannian manifold with Donaldson's algorithm to efficiently compute Ricci-flat approximations of Calabi-Yau metrics, demonstrating its effectiveness and the emergence of nontrivial local minima on the Dwork family of threefolds.
This paper introduces Adaptive Importance Sampling and Stratified Subsampling estimators that achieve minimax-optimal rates for robust high-dimensional sparse regression under heavy-tailed noise, contamination, and temporal dependence, while also providing fully specified de-biasing procedures for valid confidence intervals and demonstrating superior empirical performance over uniform subsampling.
The paper introduces Scalable Message Passing Neural Networks (SMPNNs), a deep Graph Neural Network architecture that replaces computationally expensive attention mechanisms with standard convolutional message passing within a Pre-Layer Normalization Transformer-style block, achieving state-of-the-art performance on large graphs while theoretically addressing oversmoothing through the necessity of residual connections for universal approximation.