Composite convex minimization involving self-concordant-like cost
functions

v1v2 (latest)

Composite convex minimization involving self-concordant-like cost functions

4 February 2015

ArXiv (abs)PDF HTML

Papers citing "Composite convex minimization involving self-concordant-like cost functions"

11 / 11 papers shown

Title
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit Joongkyu Lee Min-hwan Oh 93 7 0 16 May 2024
Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion Junghyun Lee Se-Young Yun Kwang-Sung Jun 118 13 0 28 Oct 2023
Layer-wise Adaptive Step-Sizes for Stochastic First-Order Methods for Deep Learning Achraf Bahamou Shiqian Ma ODL 103 0 0 23 May 2023
Dynamic pricing and assortment under a contextual MNL demand Vineet Goyal Noémie Périvier 73 19 0 19 Oct 2021
Efficient Methods for Online Multiclass Logistic Regression Naman Agarwal Satyen Kale Julian Zimmert 60 10 0 06 Oct 2021
Exponential Weights Algorithms for Selective Learning Mingda Qiao Gregory Valiant 47 2 0 29 Jun 2021
Scalable Frank-Wolfe on Generalized Self-concordant Functions via Simple Steps Alejandro Carderera Mathieu Besançon Sebastian Pokutta 106 6 0 28 May 2021
UCB-based Algorithms for Multinomial Logistic Regression Bandits Sanae Amani Christos Thrampoulidis 82 10 0 21 Mar 2021
A likelihood-based approach for multivariate categorical response regression in high dimensions Aaron J. Molstad Adam J. Rothman 56 6 0 15 Jul 2020
A Dynamic Sampling Adaptive-SGD Method for Machine Learning Achraf Bahamou Shiqian Ma ODL 32 2 0 31 Dec 2019
Generalized Self-Concordant Functions: A Recipe for Newton-Type Methods Tianxiao Sun Quoc Tran-Dinh 69 62 0 14 Mar 2017