Image de couverture de livre

Regularized Online RLHF with Generalized Bilinear Preferences

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lee, Junghyun, Hong, Minju, Jun, Kwang-Sung, Yun, Chulhee, Yun, Se-Young
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

DaringFed: A Dynamic Bayesian Persuasion Pricing for Online Federated Learning under Two-sided Incomplete Information
par: Xin, Yun, et autres
Publié: (2025)

Entry Barriers in Content Markets
par: Zhu, Haiqing, et autres
Publié: (2025)

Online Recommendations for Agents with Discounted Adaptive Preferences
par: Agarwal, Arpit, et autres
Publié: (2023)

Distortion of AI Alignment: Does Preference Optimization Optimize for Preferences?
par: Gölz, Paul, et autres
Publié: (2025)

Pessimism-Free Offline Learning in General-Sum Games via KL Regularization
par: Chen, Claire, et autres
Publié: (2026)

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
par: Maiti, Arnab, et autres
Publié: (2026)

Accelerated Preference Elicitation with LLM-Based Proxies
par: Huang, David, et autres
Publié: (2025)

Proportional Aggregation of Preferences for Sequential Decision Making
par: Chandak, Nikhil, et autres
Publié: (2023)

The Power of Regularization in Solving Extensive-Form Games
par: Liu, Mingyang, et autres
Publié: (2022)

Preferences Evolve And So Should Your Bandits: Bandits with Evolving States for Online Platforms
par: Khosravi, Khashayar, et autres
Publié: (2023)

Regularized Proportional Fairness Mechanism for Resource Allocation Without Money
par: Zeng, Sihan, et autres
Publié: (2025)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
par: Lazarsfeld, John, et autres
Publié: (2025)

Contextual Online Bilateral Trade
par: Cosson, Romain, et autres
Publié: (2026)

Online Learning with Bounded Recall
par: Schneider, Jon, et autres
Publié: (2022)

Fair Online Bilateral Trade
par: Bachoc, François, et autres
Publié: (2024)

A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits
par: Lee, Junghyun, et autres
Publié: (2024)

Offline Two-Player Zero-Sum Markov Games with KL Regularization
par: Chen, Claire, et autres
Publié: (2026)

Fundamental Limits of Game-Theoretic LLM Alignment: Smith Consistency and Preference Matching
par: Shi, Zhekun, et autres
Publié: (2025)

Nonparametric Contextual Online Bilateral Trade
par: Coccia, Emanuele, et autres
Publié: (2026)

On Randomized Algorithms in Online Strategic Classification
par: Hutton, Chase, et autres
Publié: (2026)

Fundamental Bounds on Online Strategic Classification
par: Ahmadi, Saba, et autres
Publié: (2023)

Online Omniprediction with Long-Term Constraints
par: Bechavod, Yahav, et autres
Publié: (2025)

Is Online Linear Optimization Sufficient for Strategic Robustness?
par: Cai, Yang, et autres
Publié: (2026)

Analyzing Skill Element in Online Fantasy Cricket
par: Sarkar, Sarthak, et autres
Publié: (2025)

Online Stackelberg Optimization via Nonlinear Control
par: Brown, William, et autres
Publié: (2024)

Learning-Augmented Online Bidding in Stochastic Settings
par: Angelopoulos, Spyros, et autres
Publié: (2025)

Computing Optimal Regularizers for Online Linear Optimization
par: Gatmiry, Khashayar, et autres
Publié: (2024)

The Relationship between No-Regret Learning and Online Conformal Prediction
par: Ramalingam, Ramya, et autres
Publié: (2025)

Learning in Online Principal-Agent Interactions: The Power of Menus
par: Han, Minbiao, et autres
Publié: (2023)

Online Budget Allocation with Censored Semi-Bandit Feedback
par: Bachoc, François, et autres
Publié: (2025)

Blind Inverse Game Theory: Jointly Decoding Rewards and Rationality in Entropy-Regularized Competitive Games
par: Virk, Hamza, et autres
Publié: (2025)

NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
par: Yu, Eason, et autres
Publié: (2025)

Should Decision-Makers Reveal Classifiers in Online Strategic Classification?
par: Shao, Han, et autres
Publié: (2025)

Honor Among Bandits: No-Regret Learning for Online Fair Division
par: Procaccia, Ariel D., et autres
Publié: (2024)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
par: Bechavod, Yahav, et autres
Publié: (2025)

A New Benchmark for Online Learning with Budget-Balancing Constraints
par: Braverman, Mark, et autres
Publié: (2025)

Improved Regret Bounds for Online Fair Division with Bandit Learning
par: Schiffer, Benjamin, et autres
Publié: (2025)

Online Learning for Equilibrium Pricing in Markets under Incomplete Information
par: Jalota, Devansh, et autres
Publié: (2023)

Strategic Littlestone Dimension: Improved Bounds on Online Strategic Classification
par: Ahmadi, Saba, et autres
Publié: (2024)

Online Learning under Budget and ROI Constraints via Weak Adaptivity
par: Castiglioni, Matteo, et autres
Publié: (2023)