self-concordant barrier

Barrier Algorithms for Constrained Non-Convex Optimization ICML 2024 Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling COLT 2024 Online Self-Concordant and Relatively Smooth Minimization, With Applications to Online Portfolio Selection and Learning Quantum States ALT 2023 Projection-Free Online Convex Optimization via Efficient Newton Iterations NeurIPS 2023 Quasi-Newton Steps for Efficient Online Exp-Concave Optimization COLT 2023 Unbiased constrained sampling with Self-Concordant Barrier Hamiltonian Monte Carlo NeurIPS 2023 Adaptive Bandit Convex Optimization with Heterogeneous Curvature COLT 2022 Uncoupled Learning Dynamics with $O(\log T)$ Swap Regret in Multiplayer Games NeurIPS 2022 Online Markov Decision Processes with Aggregate Bandit Feedback COLT 2021 An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020 Bias no more: high-probability data-dependent regret bounds for adversarial bandits and MDPs NeurIPS 2020 Black-box Optimization with a Politician ICML 2016 The entropic barrier: a simple and optimal universal self-concordant barrier COLT 2015