5838 papers
This paper proposes Dual Randomized Smoothing, a novel framework that overcomes the limitations of global noise variance by introducing input-dependent noise variances via a locally constant variance estimator, thereby achieving superior certified robustness across both small and large perturbation radii on CIFAR-10 and ImageNet.
This paper introduces DROCO, a novel dual-robust cross-domain offline reinforcement learning algorithm that addresses both train-time and test-time dynamics shifts by employing a robust cross-domain Bellman operator alongside dynamic value penalty and Huber loss to enhance policy robustness and prevent value estimation errors.
The paper introduces GoRL, an algorithm-agnostic framework that stabilizes online reinforcement learning with expressive generative policies by decoupling optimization in a tractable latent space from action synthesis via a conditional generative decoder, achieving superior performance on challenging continuous-control tasks.
This paper introduces Sparse Isotonic Shapley Regression (SISR), a unified framework that simultaneously learns a monotonic transformation to restore additivity and enforces sparsity constraints to provide robust, efficient, and theoretically grounded feature attributions for nonlinear, high-dimensional Explainable AI.
This paper presents a two-step generative data augmentation framework combining rule-based mask warping and unpaired image-to-image translation to address the scarcity of masked face datasets, achieving performance improvements with minimal training data while explicitly noting its origins as a resource-constrained coursework project that lacked downstream quantitative evaluation.
The paper introduces SALVE, a unified framework that combines sparse autoencoders and feature-level saliency mapping to discover, validate, and precisely edit neural network weights, enabling interpretable and robust control over both convolutional and transformer-based models.
The paper introduces LaMer, a Meta-RL framework that enhances language agents' ability to actively explore and adapt to novel environments at test time through cross-episode training and in-context policy reflection, significantly outperforming standard RL baselines across diverse tasks.
Re-Depth Anything is a test-time self-supervised framework that enhances monocular depth estimation by fusing foundation models with large-scale 2D diffusion priors to perform label-free refinement via generative re-lighting and Score Distillation Sampling, achieving state-of-the-art results without direct depth tensor optimization.
This paper proposes three complementary strategies—pre-training tailored to Newton-Kaczmarz updates, training on disjoint data subsets with model merging, and FPGA-based parallelization—to overcome the sequential bottlenecks in Kolmogorov-Arnold network training and significantly accelerate convergence.
The paper proposes "Latent Sculpting," a hierarchical two-stage architecture that combines a Transformer-based encoder with a Binary Latent Sculpting loss and a Masked Autoregressive Flow to enforce explicit geometric boundaries on benign data, achieving robust zero-shot generalization and high detection rates for out-of-distribution cyberattacks on the CIC-IDS-2017 benchmark.
This paper proposes FedORA, a primal-dual optimization framework that enables efficient and theoretically certified sample and label unlearning in Vertical Federated Learning by introducing a novel uncertainty-promoting loss function and adaptive strategies to minimize computational overhead while preserving model utility.
This paper proposes a process mining-based method that analyzes online gaming network traffic to unsupervisedly characterize device states as interpretable Petri nets and accurately classify different video games, demonstrating its effectiveness through the UPSIDE case study involving Clash Royale and Rocket League.
This paper proposes a parameter-free, equivariant topological spatial graph coarsening method that reduces graph size by collapsing short edges while preserving key topological features through a novel triangle-aware graph filtration adapted from persistent diagrams.
This paper proposes actor-critic methods with sparse robust estimator oracles to achieve the first non-vacuous guarantees for learning near-optimal policies in high-dimensional sparse offline reinforcement learning under strong data corruption and single-policy concentrability, overcoming the limitations of traditional Least Square Value Iteration approaches in such regimes.
This paper proposes weaker constraints on filters for group convolutional neural networks that reduce the required number of nodes while resolving incompatibilities with non-compact stabilizers and generalizing results to non-transitive group actions and non-unimodular groups.
This paper introduces an operator-legible evaluation framework centered on under-prediction risk to demonstrate that standard accuracy metrics fail to capture safety-critical grid forecasting needs, revealing that while explicit weather integration improves reliability, unconstrained probabilistic models often induce "fake safety" through excessive inflation, a problem solved by new Bias/OPR-constrained objectives.
This paper proposes an amortized Bayesian inference framework for graph-structured data that combines permutation-invariant summary networks with neural posterior estimators to enable fast, likelihood-free inference on node, edge, and graph-level parameters, demonstrating its effectiveness through evaluations on synthetic benchmarks and real-world applications in biology and logistics.
DevBench is a realistic, telemetry-driven benchmark comprising 1,800 instances across six languages that evaluates LLMs on code completion tasks with a focus on ecological validity, contamination-free assessment, and detailed diagnostic insights to guide practical model selection and development.
This paper presents the first component-level survey systematically reviewing the bidirectional interactions between Large Language Models and Multi-Armed Bandits, highlighting how MAB algorithms optimize LLM workflows while LLMs redefine core MAB components to enhance adaptive decision-making.
ELSA is a novel framework that integrates split learning and hierarchical federated learning with client clustering, dynamic model splitting, and privacy-preserving communication sketches to enable efficient, robust, and privacy-aware fine-tuning of large language models on resource-constrained edge networks.