Cover Image

Vanishing L2 regularization for the softmax Multi Armed Bandit

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Anita, Stefana-Lucia, Turinici, Gabriel
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Statistics Theory 68T05, 90C40, 68Q25, 90C25 F.2.2; F.1.2; I.2.6
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Practical Quantum CIM Empowerment via All-Domestic-Core Agentic Large Model
by: Rui, Wang, et al.
Published: (2026)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
by: Ryabchenko, Alexander, et al.
Published: (2026)

Robustness, Cost, and Attack-Surface Concentration in Phishing Detection
by: Allagan, Julian, et al.
Published: (2026)

From Non-Identifiability to Goal-Integrated Decision-Making in Parametric Inverse Optimization
by: Ahmadi, Farzin, et al.
Published: (2026)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)

IGT-OMD: Implicit Gradient Transport for Decision-Focused Learning under Delayed Feedback
by: Amoh, Benjamin, et al.
Published: (2026)

Discovering Algorithms with Computational Language Processing
by: Bourdais, Theo, et al.
Published: (2025)

UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guarantees
by: Chanda, Prateek, et al.
Published: (2026)

Multi-level meta-reinforcement learning with skill-based curriculum
by: Yang, Sichen, et al.
Published: (2026)

Modern column generation for estimating single- and multi-purchase ranked list choice models
by: Costa, Luciano, et al.
Published: (2026)

pFedSOP : Accelerating Training Of Personalized Federated Learning Using Second-Order Optimization
by: Sen, Mrinmay, et al.
Published: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
by: Lagerkvist, Victor, et al.
Published: (2026)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
by: Fang, Xiaolei, et al.
Published: (2026)

Quantum Advantage in Computational Chemistry?
by: Gundlach, Hans, et al.
Published: (2025)

Experimental algorithms for the dualization problem
by: Mezzini, Mauro, et al.
Published: (2025)

Approximation algorithms for the prize-collecting rural postman problem
by: Li, Hong, et al.
Published: (2026)

Accelerated Training of Federated Learning via Second-Order Methods
by: Sen, Mrinmay, et al.
Published: (2025)

Singularity-aware Optimization via Randomized Geometric Probing: Towards Stable Non-smooth Optimization
by: Xu, Ruoran, et al.
Published: (2026)

Reinterpreting EMML as Mirror Descent for Constrained Maximum Likelihood Estimation
by: Clerc, Antonin, et al.
Published: (2026)

Maximizing Rollout Informativeness under a Fixed Budget: A Submodular View of Tree Search for Tool-Use Agentic Reinforcement Learning
by: Hu, Yuelin, et al.
Published: (2026)

Multi-Agent Decision-Focused Learning via Value-Aware Sequential Communication
by: Amoh, Benjamin, et al.
Published: (2026)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
by: Neira, David E. Bernal, et al.
Published: (2021)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

The frequency $K_i$s for symmetrical traveling salesman problem
by: Wang, Yong
Published: (2025)

Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2024)

Active perception and disentangled representations allow continual, episodic zero and few-shot learning
by: Rawlinson, David, et al.
Published: (2026)

On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
by: Berker, Ratip Emin, et al.
Published: (2025)