Cover Image

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Bach, Francis
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Surprising Agreement Between Convex Optimization Theory and Learning-Rate Scheduling for Large Model Training
by: Schaipp, Fabian, et al.
Published: (2025)

On the Effectiveness of the z-Transform Method in Quadratic Optimization
by: Bach, Francis
Published: (2025)

Statistical Analysis of Conditional Group Distributionally Robust Optimization with Cross-Entropy Loss
by: Guo, Zijian, et al.
Published: (2025)

A Theoretical and Empirical Study on the Convergence of Adam with an "Exact" Constant Step Size in Non-Convex Settings
by: Mazumder, Alokendu, et al.
Published: (2023)

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization
by: Mualem, Loay, et al.
Published: (2024)

A Taxonomy of Loss Functions for Stochastic Optimal Control
by: Domingo-Enrich, Carles
Published: (2024)

A Spectral Framework for Closed-Form Relative Density Estimation
by: Bach, Francis
Published: (2026)

Scaling Laws for Gradient Descent and Sign Descent for Linear Bigram Models under Zipf's Law
by: Kunstner, Frederik, et al.
Published: (2025)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Convex Hulls of Reachable Sets
by: Lew, Thomas, et al.
Published: (2023)

Perturbed Iterate SGD for Lipschitz Continuous Loss Functions with Numerical Error and Adaptive Step Sizes
by: Metel, Michael R.
Published: (2022)

CLASP: An online learning algorithm for Convex Losses And Squared Penalties
by: Ferreira, Ricardo N., et al.
Published: (2026)

Optimal Rates for Robust Stochastic Convex Optimization
by: Gao, Changyu, et al.
Published: (2024)

Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses
by: Lowy, Andrew, et al.
Published: (2021)

Projection-free Online Learning over Strongly Convex Sets
by: Wan, Yuanyu, et al.
Published: (2020)

When to Forget? Complexity Trade-offs in Machine Unlearning
by: Van Waerebeke, Martin, et al.
Published: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates
by: Menart, Michael, et al.
Published: (2023)

Variational Inference on the Boolean Hypercube with the Quantum Entropy
by: Beyler, Eliot, et al.
Published: (2024)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
by: Wang, Jie, et al.
Published: (2024)

How hard is learning to cut? Trade-offs and sample complexity
by: Khalife, Sammy, et al.
Published: (2025)

Trade-off in Estimating the Number of Byzantine Clients in Federated Learning
by: Chen, Ziyi, et al.
Published: (2025)

The Sample-Communication Complexity Trade-off in Federated Q-Learning
by: Salgia, Sudeep, et al.
Published: (2024)

Muon Does Not Converge on Convex Lipschitz Functions
by: Parshakova, Tetiana, et al.
Published: (2026)

Fast Catch-Up, Late Switching: Optimal Batch Size Scheduling via Functional Scaling Laws
by: Wang, Jinbo, et al.
Published: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

Inexact Moreau Envelope Lagrangian Method for Non-Convex Constrained Optimization under Local Error Bound Conditions on Constraint Functions
by: Huang, Yankun, et al.
Published: (2025)

Online Convex Optimization with Memory and Limited Predictions
by: Wang, Zhengmiao, et al.
Published: (2024)

Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization
by: Dubois-Taine, Benjamin, et al.
Published: (2022)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
by: Borodich, Ekaterina, et al.
Published: (2025)

On the Role of Batch Size in Stochastic Conditional Gradient Methods
by: Islamov, Rustem, et al.
Published: (2026)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
by: Zhang, Huaqing, et al.
Published: (2024)

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
by: Zheng, Yuping, et al.
Published: (2025)

Exponential Convergence of (Stochastic) Gradient Descent for Separable Logistic Regression
by: Kale, Sacchit, et al.
Published: (2026)

Are Convex Optimization Curves Convex?
by: Barzilai, Guy, et al.
Published: (2025)

Convex and Non-convex Federated Learning with Stale Stochastic Gradients: Diminishing Step Size is All You Need
by: Zheng, Xinran, et al.
Published: (2026)

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization
by: Wang, Bokun, et al.
Published: (2023)