Image de couverture de livre

Online $\mathrm{L}^{\natural}$-Convex Minimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yokoyama, Ken, Ito, Shinji, Matsuoka, Tatsuya, Kimura, Kei, Yokoo, Makoto
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
par: Tsuchiya, Taira, et autres
Publié: (2024)

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds
par: Tsuchiya, Taira, et autres
Publié: (2024)

Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
par: Verma, Arun, et autres
Publié: (2024)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
par: Kato, Masahiro, et autres
Publié: (2024)

Learning with Posterior Sampling for Revenue Management under Time-varying Demand
par: Shimizu, Kazuma, et autres
Publié: (2024)

COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents
par: Verma, Arun, et autres
Publié: (2025)

Influential Bandits: Pulling an Arm May Change the Environment
par: Sato, Ryoma, et autres
Publié: (2025)

Topology optimization of periodic lattice structures for specified mechanical properties using machine learning considering member connectivity
par: Matsuoka, Tomoya, et autres
Publié: (2024)

A Convex Framework for Confounding Robust Inference
par: Ishikawa, Kei, et autres
Publié: (2023)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
par: Tsuchiya, Taira, et autres
Publié: (2024)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
par: Ito, Shinji, et autres
Publié: (2024)

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
par: Tsuchiya, Taira, et autres
Publié: (2023)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
par: Zhao, Canzhe, et autres
Publié: (2025)

Bandit Max-Min Fair Allocation
par: Harada, Tsubasa, et autres
Publié: (2025)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
par: Chase, Zachary, et autres
Publié: (2025)

Reinforcement Learning from Adversarial Preferences in Tabular MDPs
par: Tsuchiya, Taira, et autres
Publié: (2025)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
par: Chen, Baiyuan, et autres
Publié: (2025)

Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks
par: Samanta, Sukanya, et autres
Publié: (2024)

Analyzing Incentives and Fairness in Ordered Weighted Average for Facility Location Games
par: Yoshida, Kento, et autres
Publié: (2024)

Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs
par: Ando, Ryoto, et autres
Publié: (2024)

Compatible $k$-Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints
par: Wakasugi, Tenma, et autres
Publié: (2026)

Contaminated Online Convex Optimization
par: Kamijima, Tomoya, et autres
Publié: (2024)

Fast EXP3 Algorithms
par: Sato, Ryoma, et autres
Publié: (2025)

Alternating Regret for Online Convex Optimization
par: Hait, Soumita, et autres
Publié: (2025)

Online Episodic Convex Reinforcement Learning
par: Moreno, Bianca Marin, et autres
Publié: (2025)

Spacing Test for Fused Lasso
par: Tasaka, Rieko, et autres
Publié: (2025)

Constrained Online Convex Optimization with Memory and Predictions
par: Abdullah, Mohammed, et autres
Publié: (2026)

MixMin: Finding Data Mixtures via Convex Minimization
par: Thudi, Anvith, et autres
Publié: (2025)

Replicability is Asymptotically Free in Multi-armed Bandits
par: Komiyama, Junpei, et autres
Publié: (2024)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
par: Shibukawa, Yuki, et autres
Publié: (2026)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
par: Ichikawa, Koji, et autres
Publié: (2023)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
par: Chen, Sijia, et autres
Publié: (2023)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
par: Wan, Yuanyu, et autres
Publié: (2024)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
par: Qiu, Hao, et autres
Publié: (2025)

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions
par: Zhang, Lijun, et autres
Publié: (2025)

Online Convex Optimization with Unbounded Memory
par: Kumar, Raunak, et autres
Publié: (2022)

Unconstrained Robust Online Convex Optimization
par: Zhang, Jiujia, et autres
Publié: (2025)

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
par: Lee, Jongyeong, et autres
Publié: (2024)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
par: Lee, Jongyeong, et autres
Publié: (2025)

A Perturbation Approach to Unconstrained Linear Bandits
par: Jacobsen, Andrew, et autres
Publié: (2026)