Cover Image

Omnipredicting Single-Index Models with Multi-Index Models

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hu, Lunjia, Tian, Kevin, Yang, Chutong
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction
by: Hu, Lunjia, et al.
Published: (2026)

Testing Calibration in Nearly-Linear Time
by: Hu, Lunjia, et al.
Published: (2024)

Robustly Learning Single-Index Models via Alignment Sharpness
by: Zarifis, Nikos, et al.
Published: (2024)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
by: Kumar, Syamantak, et al.
Published: (2026)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
by: Jambulapati, Arun, et al.
Published: (2024)

Separating Oblivious and Adaptive Models of Variable Selection
by: Chen, Ziyun, et al.
Published: (2026)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
by: Li, Shuyao, et al.
Published: (2024)

Non-Stationary Online Resource Allocation: Learning from a Single Sample
by: Feng, Yiding, et al.
Published: (2026)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
by: Shah, Harsh, et al.
Published: (2025)

Multi-LLM Query Optimization
by: Dean, Arlen, et al.
Published: (2026)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
by: Cai, Yang, et al.
Published: (2022)

Active Learning for Non-Parametric Choice Models
by: Susan, Fransisca, et al.
Published: (2022)

Gradient Testing and Estimation by Comparisons
by: Tao, Xiwen, et al.
Published: (2024)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
by: Grigorescu, Elena, et al.
Published: (2024)

Learning-Augmented Algorithms for the Bahncard Problem
by: Zhao, Hailiang, et al.
Published: (2024)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)

Extended convexity and smoothness and their applications in deep learning
by: Qi, Binchuan, et al.
Published: (2024)

Non-Euclidean High-Order Smooth Convex Optimization
by: Contreras, Juan Pablo, et al.
Published: (2024)

Infrequent Resolving Algorithm for Online Linear Programming
by: Li, Guokai, et al.
Published: (2024)

Truncated Variance Reduced Value Iteration
by: Jin, Yujia, et al.
Published: (2024)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
by: Chae, Woojin, et al.
Published: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
by: Grigorescu, Elena, et al.
Published: (2024)

Gradient-Free Method for Heavily Constrained Nonconvex Optimization
by: Shi, Wanli, et al.
Published: (2024)

Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
by: Diakonikolas, Jelena, et al.
Published: (2024)

Convergence analysis of wide shallow neural operators within the framework of Neural Tangent Kernel
by: Xu, Xianliang, et al.
Published: (2024)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
by: Kim, Jung-hun, et al.
Published: (2021)

Constrained and Composite Sampling via Proximal Sampler
by: Dang, Thanh, et al.
Published: (2026)

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
by: Fountoulakis, Kimon, et al.
Published: (2026)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
by: Ferreira, Ricardo N., et al.
Published: (2025)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
by: Shugart, Henry, et al.
Published: (2025)

Robust Learning of a Group DRO Neuron
by: Cao, Guyang, et al.
Published: (2026)

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

Learning Mixtures of Spherical Gaussians via Fourier Analysis
by: Chakraborty, Somnath, et al.
Published: (2020)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
by: Shugart, Henry, et al.
Published: (2025)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
by: Kook, Yunbum, et al.
Published: (2023)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
by: Zhang, Hongyang R., et al.
Published: (2023)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)

Distributionally Robust Optimization with Adversarial Data Contamination
by: Li, Shuyao, et al.
Published: (2025)

Oracle-based Uniform Sampling from Convex Bodies
by: Dang, Thanh, et al.
Published: (2025)