Pages that link to "Item:Q3166527"
From MaRDI portal
The following pages link to Online Learning and Online Convex Optimization (Q3166527):
Displaying 50 items.
- Online learning over a decentralized network through ADMM (Q259131) (← links)
- Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
- Nonparametric stochastic approximation with large step-sizes (Q309706) (← links)
- A rolling horizon approach for stochastic mixed complementarity problems with endogenous learning: application to natural gas markets (Q342287) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training (Q508681) (← links)
- A continuous-time approach to online optimization (Q520967) (← links)
- Replicator dynamics: old and new (Q828036) (← links)
- Improved algorithms for online load balancing (Q831807) (← links)
- Simple randomized algorithms for online learning with kernels (Q889311) (← links)
- Feature-aware regularization for sparse online learning (Q893629) (← links)
- Riemannian game dynamics (Q1622363) (← links)
- Distributed multi-task classification: a decentralized online learning approach (Q1640564) (← links)
- On the information-adaptive variants of the ADMM: an iteration complexity perspective (Q1668725) (← links)
- Scale-free online learning (Q1704560) (← links)
- Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← links)
- Real-time Bayesian parameter estimation for item response models (Q1752008) (← links)
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems (Q1987437) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- Relative utility bounds for empirically optimal portfolios (Q2040434) (← links)
- A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs (Q2051672) (← links)
- Multi-armed bandit with sub-exponential rewards (Q2060366) (← links)
- A distributed Bregman forward-backward algorithm for a class of Nash equilibrium problems (Q2095329) (← links)
- Learning in nonatomic games. I: Finite action spaces and population games (Q2106066) (← links)
- Provably training overparameterized neural network classifiers with non-convex constraints (Q2106783) (← links)
- Machine learning algorithms of relaxation subgradient method with space extension (Q2117655) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Online active classification via margin-based and feature-based label queries (Q2163262) (← links)
- Testing facility location and dynamic capacity planning for pandemics with demand uncertainty (Q2171554) (← links)
- Predictive online convex optimization (Q2173950) (← links)
- Quantum tomography by regularized linear regressions (Q2174032) (← links)
- Concentration of tempered posteriors and of their variational approximations (Q2196229) (← links)
- Online supervised learning with distributed features over multiagent system (Q2225196) (← links)
- Kernel-based online regression with canal loss (Q2242215) (← links)
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds (Q2290691) (← links)
- Scale-invariant unconstrained online learning (Q2290692) (← links)
- Convergence analyses on sparse feedforward neural networks via group lasso regularization (Q2292940) (← links)
- Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations (Q2305540) (← links)
- Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs (Q2318770) (← links)
- On the robustness of learning in games with stochastically perturbed payoff observations (Q2357809) (← links)
- Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (Q2397263) (← links)
- Collaborative topic regression for online recommender systems: an online and Bayesian approach (Q2398100) (← links)
- An axiomatization of information flow measures (Q2422017) (← links)
- Personalized optimization with user's feedback (Q2665405) (← links)
- Online strongly convex optimization with unknown delays (Q2673315) (← links)
- Logarithmic regret in online linear quadratic control using Riccati updates (Q2674833) (← links)
- Regrets of proximal method of multipliers for online non-convex optimization with long term constraints (Q2679238) (← links)
- An online optimization algorithm for the real-time quantum state tomography (Q2684321) (← links)
- Event-triggered distributed online convex optimization with delayed bandit feedback (Q2698149) (← links)
