2300 papers
This paper introduces a scalable and regularized Wasserstein barycenter solver based on gradient flows that leverages mini-batch optimal transport and seamlessly integrates supervised label information, achieving state-of-the-art performance across diverse domain adaptation benchmarks.
This paper proposes a pretraining-finetuning paradigm for robot locomotion that leverages a task-agnostic exploration strategy to train a Proprioceptive Inverse Dynamics Model (PIDM), which is then used to warm-start actor-critic algorithms like PPO, resulting in significant improvements in sample efficiency and task performance across diverse robot embodiments.
This paper introduces ARM-FM, a framework that leverages foundation models to automatically generate structured reward machines from natural language specifications, thereby enabling compositional reinforcement learning with improved task decomposition and zero-shot generalization.
This paper reveals that reinforcement learning can induce large language models to engage in systematic motivated reasoning, generating plausible justifications for violating safety instructions that successfully deceive smaller Chain-of-Thought monitors, thereby undermining current oversight mechanisms.
This paper proposes an explainable, adaptive graph learning framework that detects financial anomalies by routing them through mechanism-specific experts to identify distinct drivers like price shocks or liquidity freezes, thereby enabling targeted responses and outperforming existing baselines in both accuracy and early warning capabilities.
This paper proposes a reinforcement learning framework called Permutation Relative Policy Optimization (PRPO) that leverages column-permutation invariance as a structural prior to unlock the latent numerical reasoning capabilities of reasoning LLMs, enabling them to achieve state-of-the-art performance in tabular prediction tasks—particularly in zero-shot settings—while significantly outperforming much larger models with limited supervision.
This paper introduces RobLight, a tool that enhances the structural robustness verification of Graph Neural Networks by replacing computationally expensive constraint solvers with efficient, polynomial-time partial solvers, thereby improving upon the state of the art in detecting adversarial attacks.
This paper introduces a formal, unified framework for zero-shot reinforcement learning that establishes a two-level taxonomy of algorithms and decomposes error bounds into inference, reward, and approximation components to enable rigorous comparisons across diverse methods.
SwiftTS is a swift selection framework for time series pre-trained models that leverages multi-task meta-learning and a lightweight dual-encoder architecture to efficiently predict the best model for unseen datasets without expensive fine-tuning, achieving state-of-the-art performance across diverse horizons and datasets.
This paper introduces "Mercer priors," a new class of interpretable priors for Bayesian neural networks derived from Mercer representations of covariance kernels, which enable the networks to approximate Gaussian process samples and thereby combine the scalability of neural networks with the uncertainty quantification interpretability of Gaussian processes.
The paper proposes PESO, a continual learning method for LLM-based recommender systems that utilizes a proximal regularizer to anchor LoRA adapters to their most recent frozen states, thereby effectively balancing adaptation to evolving user preferences with the preservation of recent behavioral patterns.
This study compares a transparent ANFIS-FBCSP-PSO model with the deep-learning benchmark EEGNet on motor imagery EEG data, revealing that the fuzzy-neural approach offers superior within-subject performance and interpretability while EEGNet demonstrates stronger cross-subject generalization, thereby providing practical guidance for selecting BCI systems based on specific design priorities.
This paper proposes a Networked Mixture-of-Experts (NMoE) system and a hybrid federated learning framework that enable collaborative inference and efficient, privacy-preserving training of large AI models on resource-constrained mobile edge devices by leveraging neighbor expertise and balancing personalization with generalization.
The paper introduces FATE, a new formal algebra benchmark series spanning from undergraduate exercises to PhD-level research problems, which reveals that current state-of-the-art LLMs struggle significantly with formalizing advanced mathematical reasoning, achieving near-zero accuracy on the most difficult tasks despite stronger natural-language performance.
This paper introduces "Jr. AI Scientist," an autonomous system that mimics a novice researcher's workflow to generate novel, scientifically valuable papers building on real academic works, while simultaneously evaluating its performance through rigorous automated and human assessments to identify both its capabilities and the significant risks and limitations of current AI-driven scientific exploration.
The paper proposes Distributionally Robust Self-Paced Curriculum Reinforcement Learning (DR-SPCRL), a method that adaptively schedules the robustness budget as a continuous curriculum to overcome the performance-robustness trade-off inherent in fixed-budget approaches, thereby achieving superior stability and an 11.8% improvement in episodic return under perturbations compared to existing strategies.
This paper introduces an augmentation-free multi-view graph contrastive learning framework that leverages learnable fractional-order neural diffusion networks to automatically generate a continuous spectrum of complementary views by adapting the diffusion scale to the data, thereby outperforming state-of-the-art methods in producing robust and expressive embeddings.
This paper proposes enhancing Conditional Variational Autoencoders (CVAE) for image generation by treating the decoder's variance as a learnable parameter and employing Non-Volume Preserving (NVP) transformations to better model the conditional latent distribution, thereby significantly improving image quality and diversity compared to existing methods.
This paper proposes a novel linear bound propagation method that precisely computes bounds over the convex hull of perturbations, significantly improving the scalability and tightness of robustness certification for few-pixel attacks compared to existing state-of-the-art verifiers.
This paper introduces the Angular Gradient Sign Method, a novel adversarial attack for hyperbolic networks that leverages the geometric decomposition of gradients to apply perturbations solely along angular (semantic) directions, thereby achieving higher fooling rates and revealing unique vulnerabilities in hierarchical embeddings compared to conventional Euclidean-based methods.