Cover Image

Efficient Opportunistic Approachability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Marinov, Teodor Vanislavov, Mohri, Mehryar, Okoroafor, Princewill, Schneider, Jon, Zimmert, Julian
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Incentive-compatible Bandits: Importance Weighting No More
by: Zimmert, Julian, et al.
Published: (2024)

Distributional Alignment Games for Answer-Level Fine-Tuning
by: Mohri, Mehryar, et al.
Published: (2026)

Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)

High-Dimensional Calibration from Swap Regret
by: Fishelson, Maxwell, et al.
Published: (2025)

Swap Regret and Correlated Equilibria Beyond Normal-Form Games
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2025)

Next-Token Prediction and Regret Minimization
by: Mohri, Mehryar, et al.
Published: (2026)

Online Learning with Bounded Recall
by: Schneider, Jon, et al.
Published: (2022)

Strategizing against No-regret Learners
by: Deng, Yuan, et al.
Published: (2019)

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
by: Kumar, Rachitesh, et al.
Published: (2024)

Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
by: Leme, Renato Paes, et al.
Published: (2022)

Learning to Play Against Unknown Opponents
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

A New Benchmark for Online Learning with Budget-Balancing Constraints
by: Braverman, Mark, et al.
Published: (2025)

Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
by: Chakrabarti, Darshan, et al.
Published: (2024)

Rate-Preserving Reductions for Blackwell Approachability
by: Dann, Christoph, et al.
Published: (2024)

Time-Dependent Blackwell Approachability and Application to Absorbing Games
by: Kwon, Joon, et al.
Published: (2023)

Computing Optimal Regularizers for Online Linear Optimization
by: Gatmiry, Khashayar, et al.
Published: (2024)

Beyond Arrow: From Impossibility to Possibilities in Multi-Criteria Benchmarking
by: Gordienko, Polina, et al.
Published: (2026)

DUPRE: Data Utility Prediction for Efficient Data Valuation
by: Pham, Kieu Thao Nguyen, et al.
Published: (2025)

Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty
by: Lobo, Elita, et al.
Published: (2024)

Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
by: Lu, Jiuyao, et al.
Published: (2025)

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
by: Schiffer, Benjamin, et al.
Published: (2025)

CHG Shapley: Efficient Data Valuation and Selection towards Trustworthy Machine Learning
by: Cai, Huaiguang
Published: (2024)

Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation
by: Ren, Hang, et al.
Published: (2025)

Data Valuation for LLM Fine-Tuning: Efficient Shapley Value Approximation via Language Model Arithmetic
by: Tamine, Mélissa, et al.
Published: (2025)

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
by: Farina, Gabriele, et al.
Published: (2026)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
by: Maiti, Arnab, et al.
Published: (2026)

Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)

Contextual Dynamic Pricing with Heterogeneous Buyers
by: Lykouris, Thodoris, et al.
Published: (2025)

Efficient Learning and Computation of Linear Correlated Equilibrium in General Convex Games
by: Daskalakis, Constantinos, et al.
Published: (2024)

Experience-replay Innovative Dynamics
by: Zhang, Tuo, et al.
Published: (2025)

Zeroth-Order Stackelberg Control in Combinatorial Congestion Games
by: Masiha, Saeed, et al.
Published: (2026)

Aumann-SHAP: The Geometry of Counterfactual Interaction Explanations in Machine Learning
by: Belahcen, Adam, et al.
Published: (2026)

Enhancing Affine Maximizer Auctions with Correlation-Aware Payment
by: Sun, Haoran, et al.
Published: (2026)

Nonparametric Contextual Online Bilateral Trade
by: Coccia, Emanuele, et al.
Published: (2026)

Learning to Allocate Resources with Censored Feedback
by: Montanari, Giovanni, et al.
Published: (2026)

Constraint-Aware Generative Auto-bidding via Pareto-Prioritized Regret Optimization
by: Wu, Binglin, et al.
Published: (2026)

Tight Regret Bounds for Bilateral Trade under Semi Feedback
by: Jin, Yaonan
Published: (2026)

Temporal-Decay Shapley: A Time-Aware Data Valuation Framework for Time-Series Data
by: Pang, Chuwen, et al.
Published: (2026)

Learning to Bid in FCR Markets: A Best-of-Both-Worlds Approach
by: Potfer, Marius, et al.
Published: (2026)