Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Yokoyama, Ken, Ito, Shinji, Matsuoka, Tatsuya, Kimura, Kei, Yokoo, Makoto
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
por: Tsuchiya, Taira, et al.
Publicado: (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
por: Tsuchiya, Taira, et al.
Publicado: (2024)

Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
por: Verma, Arun, et al.
Publicado: (2024)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
por: Kato, Masahiro, et al.
Publicado: (2024)

Learning with Posterior Sampling for Revenue Management under Time-varying Demand
por: Shimizu, Kazuma, et al.
Publicado: (2024)

COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents
por: Verma, Arun, et al.
Publicado: (2025)

Influential Bandits: Pulling an Arm May Change the Environment
por: Sato, Ryoma, et al.
Publicado: (2025)

Topology optimization of periodic lattice structures for specified mechanical properties using machine learning considering member connectivity
por: Matsuoka, Tomoya, et al.
Publicado: (2024)

A Convex Framework for Confounding Robust Inference
por: Ishikawa, Kei, et al.
Publicado: (2023)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
por: Tsuchiya, Taira, et al.
Publicado: (2024)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
por: Ito, Shinji, et al.
Publicado: (2024)

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
por: Tsuchiya, Taira, et al.
Publicado: (2023)

Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyond
por: Zhao, Canzhe, et al.
Publicado: (2025)

Bandit Max-Min Fair Allocation
por: Harada, Tsubasa, et al.
Publicado: (2025)

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
por: Chase, Zachary, et al.
Publicado: (2025)

Reinforcement Learning from Adversarial Preferences in Tabular MDPs
por: Tsuchiya, Taira, et al.
Publicado: (2025)

Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
por: Chen, Baiyuan, et al.
Publicado: (2025)

Solving a Stackelberg Game on Transportation Networks in a Dynamic Crime Scenario: A Mixed Approach on Multi-Layer Networks
por: Samanta, Sukanya, et al.
Publicado: (2024)

Analyzing Incentives and Fairness in Ordered Weighted Average for Facility Location Games
por: Yoshida, Kento, et al.
Publicado: (2024)

Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs
por: Ando, Ryoto, et al.
Publicado: (2024)

Compatible $k$-Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints
por: Wakasugi, Tenma, et al.
Publicado: (2026)

Contaminated Online Convex Optimization
por: Kamijima, Tomoya, et al.
Publicado: (2024)

Fast EXP3 Algorithms
por: Sato, Ryoma, et al.
Publicado: (2025)

Alternating Regret for Online Convex Optimization
por: Hait, Soumita, et al.
Publicado: (2025)

Online Episodic Convex Reinforcement Learning
por: Moreno, Bianca Marin, et al.
Publicado: (2025)

Spacing Test for Fused Lasso
por: Tasaka, Rieko, et al.
Publicado: (2025)

Constrained Online Convex Optimization with Memory and Predictions
por: Abdullah, Mohammed, et al.
Publicado: (2026)

MixMin: Finding Data Mixtures via Convex Minimization
por: Thudi, Anvith, et al.
Publicado: (2025)

Replicability is Asymptotically Free in Multi-armed Bandits
por: Komiyama, Junpei, et al.
Publicado: (2024)

Combinatorial Allocation Bandits with Nonlinear Arm Utility
por: Shibukawa, Yuki, et al.
Publicado: (2026)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
por: Ichikawa, Koji, et al.
Publicado: (2023)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
por: Chen, Sijia, et al.
Publicado: (2023)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
por: Wan, Yuanyu, et al.
Publicado: (2024)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
por: Qiu, Hao, et al.
Publicado: (2025)

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions
por: Zhang, Lijun, et al.
Publicado: (2025)

Online Convex Optimization with Unbounded Memory
por: Kumar, Raunak, et al.
Publicado: (2022)

Unconstrained Robust Online Convex Optimization
por: Zhang, Jiujia, et al.
Publicado: (2025)

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

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
por: Lee, Jongyeong, et al.
Publicado: (2025)

A Perturbation Approach to Unconstrained Linear Bandits
por: Jacobsen, Andrew, et al.
Publicado: (2026)