SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Personalized optimization with user’s feedback
16 references·0 citing·41 second hop
Personalized optimization with user’s feedback (2021)Personalized optimization with user’s fee…Bandit Convex Optimization for Scalable and Dynamic IoT Management (2018)Bandit Convex Optimization fo…Online Optimization : Competing with Dynamic Comparators (2015)Online Optimization : Competi…The shortest path to happiness (2014)The shortest path to happinessNon-Stationary Stochastic Optimization (2013)Non-Stationary Stochastic Opt…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Online Learning and Online Convex Optimization (2012)Online Learning and Online Co…Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Information-Theoretic Regret …Online Learning and Online Convex Optimization (2011)Online Learning and Online Co…Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback. (2010)Optimal Algorithms for Online…Adapting to a Changing Environment: the Brownian Restless Bandits. (2008)Adapting to a Changing Enviro…Online convex optimization in the bandit setting: gradient descent without a gradient (2004)Online convex optimization in…Mixed MNL models for discrete response (2000)Mixed MNL models for discrete…The Effectiveness of Alternative Preference Elicitation Procedures in Predicting Choice (1993)The Effectiveness of Alternat…Prospect theory: An analysis of decision under risk (1988)Prospect theory: An analysis …Prospect Theory: An Analysis of Decision under Risk (1979)Prospect Theory: An Analysis …Online convex programming and generalized infinitesimal gradient ascent (2003)Introduction to Stochastic Programming (2011)INTRODUCTION TO STOCHASTIC SEARCH AND OPTIMIZATION: ESTIMATION, SIMULATION, AND CONTROL (2012)Introduction to Online Convex Optimization (2016)A Stochastic Approximation Method (1951)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Prediction, Learning, and Games (2006)Taking the Human Out of the Loop: A Review of Bayesian Optimization (2015)Introduction to Online Convex Optimization (2016)Walking Distances to and from Light-Rail Transit Stations (1996)The secret life of pronouns (2011)Walkable City: How Downtown Can Save America, One Step at a Time (2012)Aesthetic capital (2014)Algorithms (and the) everyday (2019)Urban Computing Leveraging Location-Based Social Network Data (2019)Some aspects of the sequential design of experiments (1952)The Nonstochastic Multiarmed Bandit Problem (2002)Big Data Deep Learning: Challenges and Perspectives (2014)A survey of machine learning for big data processing (2016)A survey on deep learning for big data (2017)Risk, Ambiguity, and the Savage Axioms (1961)Judgment under Uncertainty: Heuristics and Biases (1975)The Framing of Decisions and the Psychology of Choice (1981)Exploration and Exploitation in Organizational Learning (1991)Explicating dynamic capabilities: the nature and microfoundations of (sustainable) enterprise performance (2007)Theory of games and economic behavior (2019)A Method for Minimizing the Impact of Distributional Assumptions in Econometric Models for Duration Data (1984)A Method of Simulated Moments for Estimation of Discrete Response Models Without Numerical Integration (1989)Measuring Market Power in the Ready-to-Eat Cereal Industry (1998)Mixed Logit with Repeated Choices: Households' Choices of Appliance Efficiency Level (1998)A latent class model for discrete choice analysis: contrasts with mixed logit (2003)The Mixed Logit model: The state of practice (2003)Associative Reinforcement Learning using Linear Probabilistic Concepts (1999)Beating the adaptive bandit with high probability (2009)Improved Algorithms for Linear Stochastic Bandits (2011)Introduction to Multi-Armed Bandits (2019)Bandit Algorithms (2020)Interpolation of Spatial Data (1999)A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning (2010)Practical Bayesian Optimization of Machine Learning Algorithms (2012)Advances in prospect theory: Cumulative representation of uncertainty (1992)
this work references cited by second hop

References

  • 1979Prospect Theory: An Analysis of Decision under Risk48,459 cited
  • 1988Prospect theory: An analysis of decision under risk32,475 cited
  • 2000Mixed MNL models for discrete response4,354 cited
  • 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting2,280 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,483 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,302 cited
  • 2012Online Learning and Online Convex Optimization1,265 cited
  • 2011Online Learning and Online Convex Optimization1,170 cited
  • 2004Online convex optimization in the bandit setting: gradient descent without a gradient642 cited
  • 2014The shortest path to happiness383 cited
  • 2013Non-Stationary Stochastic Optimization373 cited
  • 2010Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.255 cited
  • 1993The Effectiveness of Alternative Preference Elicitation Procedures in Predicting Choice179 cited
  • 2015Online Optimization : Competing with Dynamic Comparators175 cited
  • 2008Adapting to a Changing Environment: the Brownian Restless Bandits.

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

141 cited
  • 2018Bandit Convex Optimization for Scalable and Dynamic IoT Management139 cited
  • Cited by

    No citing works inside the corpus for this window.