Imagen de Portada

Group-wise oracle-efficient algorithms for online multi-group learning

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Deng, Samuel, Hsu, Daniel, Liu, Jingwen
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

No-regret incentive-compatible online learning under exact truthfulness with non-myopic experts
por: Komiyama, Junpei, et al.
Publicado: (2025)

An explainable machine learning-based approach for analyzing customers' online data to identify the importance of product attributes
por: Karimzadeh, Aigin, et al.
Publicado: (2024)

Improved learning rates in multi-unit uniform price auctions
por: Potfer, Marius, et al.
Publicado: (2025)

On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX
por: Mortazavi, Ali, et al.
Publicado: (2024)

Conservative classifiers do consistently well with improving agents: characterizing statistical and online learning
por: Sharma, Dravyansh, et al.
Publicado: (2025)

A survey on multi-player bandits
por: Boursier, Etienne, et al.
Publicado: (2022)

Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms
por: Pudovikov, Andrey, et al.
Publicado: (2025)

Hedging and Approximate Truthfulness in Traditional Forecasting Competitions
por: Monroe, Mary, et al.
Publicado: (2024)

Emergent specialization from participation dynamics and multi-learner retraining
por: Dean, Sarah, et al.
Publicado: (2022)

Sink equilibria and the attractors of learning in games
por: Biggar, Oliver, et al.
Publicado: (2025)

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

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes
por: Lei, Qi, et al.
Publicado: (2020)

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

Offline Two-Player Zero-Sum Markov Games with KL Regularization
por: Chen, Claire, et al.
Publicado: (2026)

C2:Cross learning module enhanced decision transformer with Constraint-aware loss for auto-bidding
por: Ding, Jinren, et al.
Publicado: (2026)

Learning in Bayesian Stackelberg Games With Unknown Follower's Types
por: Bollini, Matteo, et al.
Publicado: (2026)

Playing Markov Games Without Observing Payoffs
por: Ablin, Daniel, et al.
Publicado: (2025)

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

Protocols for Verifying Smooth Strategies in Bandits and Games
por: Christ, Miranda, et al.
Publicado: (2025)

Automated Deterministic Auction Design with Objective Decomposition
por: Duan, Zhijian, et al.
Publicado: (2024)

An Adaptable Budget Planner for Enhancing Budget-Constrained Auto-Bidding in Online Advertising
por: Duan, Zhijian, et al.
Publicado: (2025)

Towards Performatively Stable Equilibria in Decision-Dependent Games for Arbitrary Data Distribution Maps
por: Zhong, Guangzheng, et al.
Publicado: (2025)

Data Pricing for Graph Neural Networks without Pre-purchased Inspection
por: Liu, Yiping, et al.
Publicado: (2025)

High dimensional online calibration in polynomial time
por: Peng, Binghui
Publicado: (2025)

GroupSegment-SHAP: Shapley Value Explanations with Group-Segment Players for Multivariate Time Series
por: Kim, Jinwoong, et al.
Publicado: (2026)

Fairness-aware Contextual Dynamic Pricing with Strategic Buyers
por: Liu, Pangpang, et al.
Publicado: (2025)

Mitigating the Participation Bias by Balancing Extreme Ratings
por: Guo, Yongkang, et al.
Publicado: (2025)

Regulation Games for Trustworthy Machine Learning
por: Yaghini, Mohammad, et al.
Publicado: (2024)

To Give or Not to Give? The Impacts of Strategically Withheld Recourse
por: Chen, Yatong, et al.
Publicado: (2025)

The Power of Regularization in Solving Extensive-Form Games
por: Liu, Mingyang, et al.
Publicado: (2022)

Predicting human decisions with behavioral theories and machine learning
por: Plonsky, Ori, et al.
Publicado: (2019)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
por: Liu, Junyan, et al.
Publicado: (2026)

Incentivizing High-Quality Human Annotations with Golden Questions
por: Liu, Shang, et al.
Publicado: (2025)

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

Trajectory-wise Iterative Reinforcement Learning Framework for Auto-bidding
por: Li, Haoming, et al.
Publicado: (2024)

Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
por: Liu, Junyan, et al.
Publicado: (2025)

Fundamental Limits of Game-Theoretic LLM Alignment: Smith Consistency and Preference Matching
por: Shi, Zhekun, et al.
Publicado: (2025)

Free-Rider and Conflict Aware Collaboration Formation for Cross-Silo Federated Learning
por: Chen, Mengmeng, et al.
Publicado: (2024)

NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
por: Yu, Eason, et al.
Publicado: (2025)

HiBid: A Cross-Channel Constrained Bidding System with Budget Allocation by Hierarchical Offline Deep Reinforcement Learning
por: Wang, Hao, et al.
Publicado: (2023)