SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization
9 references·0 citing·32 second hop
Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization (2016)Noisy Submodular Maximization via Adaptiv…Combinatorial Pure Exploration of Multi-Armed Bandits (2014)Combinatorial Pure Exploratio…Linear Submodular Bandits and their Application to Diversified Retrieval (2011)Linear Submodular Bandits and…Pure Exploration in Multi-armed Bandits Problems (2009)Pure Exploration in Multi-arm…Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems (2006)Action Elimination and Stoppi…Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems (2006)Action Elimination and Stoppi…Individual choice behavior: A theoretical analysis. (2005)Individual choice behavior: A…Individual Choice Behavior: A Theoretical Analysis. (1960)Individual Choice Behavior: A…RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS (1954)RANK ANALYSIS OF INCOMPLETE B…Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons (1952)Rank Analysis of Incomplete B…Some aspects of the sequential design of experiments (1952)Finite-time Analysis of the Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Parallelizing Exploration-Exploitation Tradeoffs with Gaussian Process Bandit Optimization (2012)Almost Optimal Exploration in Multi-Armed Bandits (2013)Non-stochastic Best Arm Identification and Hyperparameter Optimization (2015)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Combinatorial Multi-Armed Bandit with General Reward Functions (2016)Non-Asymptotic Pure Exploration by Solving Games (2019)Pure Exploration with Multiple Correct Answers (2019)Learning diverse rankings with multi-armed bandits (2008)Stochastic Linear Optimization Under Bandit Feedback (2008)Contextual Bandits with Linear Payoff Functions (2011)Matroid Bandits: Fast Combinatorial Optimization with Learning (2014)Learning Hidden Features for Contextual Bandits (2016)Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits (2023)Gambling in a rigged casino: The adversarial multi-armed bandit problem (2002)The Epoch-Greedy algorithm for contextual multi-armed bandits (2007)UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem (2010)A theory of data. (1960)Discrete Choice Methods and their Applications to Short Term Travel Decisions (1999)SWIFT: A Dynamical Model of Saccade Generation During Reading. (2005)Binary-Choice Constraints and Random Utility Indicators (1960) (1974)MM algorithms for generalized Bradley-Terry models (2004)Metric structures in ordinal data (1966)Patrick Suppes and Joseph L. Zinnes. Basic measurement theory. Handbook of mathematical psychology, Volume I, edited by R. Duncan Luce, Robert R. Bush, and Eugene Galanter, John Wiley and Sons, Inc., New York and London1963, pp. 1–76. (1971)The offset tree for learning with partial labels (2009)The multi-armed bandit problem with covariates (2011)Optimal Best Arm Identification with Fixed Confidence (2016)Elimination by aspects: A theory of choice. (1972)Task complexity and contingent processing in decision making: An information search and protocol analysis (1976)Increasing Returns and Path Dependence in the Economy (1994)
this work references cited by second hop

References

  • 1960Individual Choice Behavior: A Theoretical Analysis.2,504 cited
  • 1952Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons2,408 cited
  • 2005Individual choice behavior: A theoretical analysis.1,157 cited
  • 1954RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS716 cited
  • 2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems410 cited
  • 2009Pure Exploration in Multi-armed Bandits Problems365 cited
  • 2006Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems184 cited
  • 2014Combinatorial Pure Exploration of Multi-Armed Bandits104 cited
  • 2011Linear Submodular Bandits and their Application to Diversified Retrieval101 cited

Cited by

No citing works inside the corpus for this window.

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