Cover Image

Online Omniprediction with Long-Term Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bechavod, Yahav, Lu, Jiuyao, Roth, Aaron
Format:	Preprint
Published:	2025
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

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
by: Bechavod, Yahav, et al.
Published: (2025)

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

The Relationship between No-Regret Learning and Online Conformal Prediction
by: Ramalingam, Ramya, et al.
Published: (2025)

Incentive-Aware Dynamic Resource Allocation under Long-Term Cost Constraints
by: Dai, Yan, et al.
Published: (2025)

Intersectional Fairness in Reinforcement Learning with Large State and Constraint Spaces
by: Eaton, Eric, et al.
Published: (2025)

Forecasting for Swap Regret for All Downstream Agents
by: Roth, Aaron, et al.
Published: (2024)

Prior-Agnostic Incentive-Compatible Exploration
by: Ramalingam, Ramya, et al.
Published: (2026)

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

Online Learning under Budget and ROI Constraints via Weak Adaptivity
by: Castiglioni, Matteo, et al.
Published: (2023)

User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization
by: Cai, Yang, et al.
Published: (2023)

Monotone Individual Fairness
by: Bechavod, Yahav
Published: (2024)

Networked Information Aggregation via Machine Learning
by: Kearns, Michael, et al.
Published: (2025)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024)

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
by: Xin, Yun, et al.
Published: (2025)

Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)

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

Fair Online Bilateral Trade
by: Bachoc, François, et al.
Published: (2024)

Emergent Alignment via Competition
by: Collina, Natalie, et al.
Published: (2025)

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

Fundamental Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2023)

On Randomized Algorithms in Online Strategic Classification
by: Hutton, Chase, et al.
Published: (2026)

Auto-bidding under Return-on-Spend Constraints with Uncertainty Quantification
by: Han, Jiale, et al.
Published: (2025)

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
by: Aggarwal, Gagan, et al.
Published: (2024)

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics
by: Lucier, Brendan, et al.
Published: (2023)

Analyzing Skill Element in Online Fantasy Cricket
by: Sarkar, Sarthak, et al.
Published: (2025)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

Online Stackelberg Optimization via Nonlinear Control
by: Brown, William, et al.
Published: (2024)

Regularized Online RLHF with Generalized Bilinear Preferences
by: Lee, Junghyun, et al.
Published: (2026)

Is Online Linear Optimization Sufficient for Strategic Robustness?
by: Cai, Yang, et al.
Published: (2026)

Algorithmic Collusion Without Threats
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

Online Budget Allocation with Censored Semi-Bandit Feedback
by: Bachoc, François, et al.
Published: (2025)

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

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

Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
by: Shao, Han, et al.
Published: (2025)

Improved Regret Bounds for Online Fair Division with Bandit Learning
by: Schiffer, Benjamin, et al.
Published: (2025)

Honor Among Bandits: No-Regret Learning for Online Fair Division
by: Procaccia, Ariel D., et al.
Published: (2024)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
by: Jalota, Devansh, et al.
Published: (2023)

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
by: Ahmadi, Saba, et al.
Published: (2024)

Tractable Agreement Protocols
by: Collina, Natalie, et al.
Published: (2024)

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
by: Wang, Yige, et al.
Published: (2025)