ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2606.14268· 18 results

cs.LGcs.AIstat.MLRecentMay 30, 2026

A Practical Upper Bound on Selection Bias Effects in Medical Prediction Models

Kara Liu, Maggie Wang, Russ B. Altman

The paper proposes a novel, practical upper bound to estimate the worst-case performance of medical prediction models on the target population, even when the selection bias mechanism and target data a…

View →
math.STcs.LGmath.PREmpiricalRecentJun 4, 2026

How abundant are good interpolators?

August Y. Chen, Ahmed El Alaoui

This paper establishes a large deviation principle for the generalization error of interpolating classifiers in the overparametrized regime.

View →
math.STcs.LGmath.PREmpiricalRecentJun 4, 2026

How abundant are good interpolators?

August Y. Chen, Ahmed El Alaoui

This paper establishes a large deviation principle for the generalization error of interpolating classifiers in the overparametrized regime.

View →
stat.MLcs.LGRecentJun 1, 2026

Doing well with less! On Sampling Techniques for Empirical Pairwise Loss Estimation/Minimization

Louise Davy, Stephan Clémençon, Charlotte Laclau

This paper introduces survey sampling techniques to estimate or minimize empirical pairwise loss functions, showing that targeting informative pairs significantly reduces computational cost while main…

View →
cs.LGcs.AIRecentMay 27, 2026

Learning Theory of the SVRG: Generalization and Convergence Analysis

Yunwen Lei, Zimeng Wang, Xiaoming Yuan

This paper provides the first non-vacuous generalization analysis for the Stochastic Variance Reduced Gradient (SVRG) method by establishing sharp, data-dependent algorithmic stability bounds, thereby…

View →
cs.LGcs.AImath.OCRecentMay 28, 2026

A Unified Framework for Gradient Aggregation in Multi-Objective Optimization

Zeou Hu, Kelvin Ho, Yaoliang Yu

The paper introduces a unified theoretical framework for gradient aggregation in multi-objective optimization, establishing convergence rates and sufficient conditions for achieving Pareto stationarit…

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Improved Distribution Estimation in $\ell_\infty$

Doron Cohen, Aryeh Kontorovich, Yonatan Livshitz

This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.

View →
cs.LGcs.AIRecentMay 28, 2026

Score Broadcast and Decorrelation: A General Framework for Broadcast-Based Credit Assignment

Mustafa Uzun, Mete Erdogan, Cengiz Pehlevan, Alper T. Erdogan

The paper introduces Score Broadcast and Decorrelation (SBD), a general theoretical framework that unifies broadcast-based credit assignment across various differentiable loss functions by leveraging…

View →
cs.NEcs.AIEmpiricalRecentJun 10, 2026

SPEA2$^+$: Improved Density Estimation in SPEA2 with Provable Runtime Guarantees

Duc-Cuong Dang, Andre Opris, Dirk Sudholt

The paper conducts a runtime analysis of the Strength Pareto Evolutionary Algorithm 2 (SPEA2) and proposes an improved variant, SPEA2$^+$, to address its limitations in handling dominated solutions.

View →
q-fin.RMcs.AIcs.CRRecentMay 6, 2026

The Insurability Frontier of AI Risk: Mapping Threats to Affirmative Coverage, Silent Exposures, and Exclusions

Alex Leung, Rex Zhang, Ervin Ling, Kentaroh Toyoda +1 more

This paper maps the emerging insurability frontier of AI risk by coding 55 AI threat classes against 26 insurance products, identifying four tiers of coverage: affirmative, silent, excluded, and outsi…

View →
math.STstat.MEstat.MLRecentJun 4, 2026

Estimation of the sub-Gaussian parameter

Jason Liu, Min Xu, Jinchuan Xing

This paper introduces and analyzes a consistent estimator for the sub-Gaussian parameter ($\xi_*^2$), providing convergence rates and demonstrating its applicability in large-scale biological enrichme…

View →
cs.LGcs.AIcs.NERecentMay 28, 2026

Evolving Features vs Evolving Entire Trees with GP for Interpretable Survival Analysis

Thalea Schlender, Peter A. N. Bosman, Tanja Alderliesten

This paper proposes using genetic programming (GP) to jointly evolve both the feature sets and the structure of survival trees, resulting in highly interpretable and high-performing shallow models for…

View →
cs.LGcs.CRRecentJun 1, 2026

Near-Optimal Pure Machine Unlearning for Smooth Strongly Convex Losses

Matthew Regehr, Gautam Kamath, Andrew Lowy

The paper establishes tight upper and lower bounds on the statistical cost of approximate machine unlearning for smooth strongly convex losses, showing that the optimal unlearning rate depends critica…

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Reward Learning from Best-of-$N$ Preference Data: Targets, Tradeoffs, and Design Principles

Rattana Pukdee, Maria-Florina Balcan, Pradeep Ravikumar

This paper analyzes Best-of-$N$ preference data, deriving explicit reward targets for independent-reference variants and establishing design principles for choosing $N$ and the base distribution to op…

View →
cs.LGcs.AIcs.CVRecentJun 1, 2026

Rethinking Evaluation Paradigms in IBP-based Certified Training

Konstantin Kaulen, Hadar Shavit, Holger H. Hoos

The paper proposes evaluating certified training methods by comparing their Pareto fronts across the natural-certified accuracy trade-off, revealing superior performance and previously unappreciated c…

View →
math.STstat.MEstat.MLRecentJun 4, 2026

Optimally taming biases in black-box models for efficient semiparametric estimation

Yihong Gu, Qishuo Yin, Tianxi Cai, Jianqing Fan

The paper proposes a new, optimal estimator for semiparametric inference that improves upon standard double machine learning (DML) rates by eliminating the first-order stochastic error of nuisance fun…

View →
cs.LGcs.AIstat.MLRecentMay 28, 2026

Calibrated Preference Learning: The Case of Label Ranking

Santo M. A. R. Thies, Viktor Bengs, Timo Kaufmann, Sebastian J. Vollmer +1 more

The paper formalizes the concept of calibration for probabilistic label ranking, demonstrating that popular models are often poorly calibrated and that calibration captures a meaningful quality dimens…

View →
cs.CVcs.AIRecentJun 1, 2026

Why Not Hyperparameter-Friendly Optimisation? A Monotonic Adaptive Norm Rescaling Approach For Long-Tailed Recognition

Shuo Zhang, Chenqi Li, Tingting Zhu

The paper proposes Self-Adaptive Monotonic Normalization (SAMN), a hyperparameter-friendly method that improves long-tailed recognition by enforcing monotonicity on per-class weight norms without requ…

View →