Alex Samorodnitsky

2009

A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 14 researchers here, as inferred from the citation graph.

Whom Alex Samorodnitsky trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Martin A. Zinkevich
  2. Daniel A. Spielman

Who trusts Alex Samorodnitsky overall

  1. H. Brendan McMahan
  2. Abhradeep Thakurta
  3. Daniel Russo
  4. Adam D. Smith
  5. Yu-Xiang Wang
  6. Ankan Saha
  7. Jingwei Zhang
  8. Vitaly Feldman

Papers from Alex Samorodnitsky's perspective

Ordered by how strongly the researchers Alex Samorodnitsky trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Online Convex Programming and Generalized Infinitesimal Gradient Ascent
  2. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (Symposium on the Theory of Computing)
  3. The weighted majority algorithm
  4. Gambling in a rigged casino: The adversarial multi-armed bandit problem
  5. Gradient-based learning applied to document recognition
  6. Markov Decision Processes: Discrete Stochastic Dynamic Programming
  7. Smooth minimization of non-smooth functions
  8. Representation Learning: A Review and New Perspectives
  9. On the generalization ability of on-line learning algorithms
  10. Exponentiated Gradient Versus Gradient Descent for Linear Predictors

Their papers