user avatar
Daniel Levy
@daniellevy__
cofounder at @ssi
Stanford, CA
Joined October 2009
Posts
  • user avatar
    Beyond excited to be starting this company with Ilya and DG! I can't imagine working on anything else at this point in human history. If you feel the same and want to work in a small, cracked, high-trust team that will produce miracles, please reach out.
    Superintelligence is within reach. Building safe superintelligence (SSI) is the most important technical problem of our​​ time. We've started the world’s first straight-shot SSI lab, with one goal and one product: a safe superintelligence. It’s called Safe Superintelligence
  • user avatar
    Time to get to work ⛰️👷‍♂️
    SSI is building a straight shot to safe superintelligence. We’ve raised $1B from NFDG, a16z, Sequoia, DST Global, and SV Angel. We’re hiring: ssi.inc
  • user avatar
    I sent the following message to our team and investors: — As you know, Daniel Gross’s time with us has been winding down, and as of June 29 he is officially no longer a part of SSI. We are grateful for his early contributions to the company and wish him well in his next
  • user avatar
    Our paper (with Matt Hoffman and @jaschasd) on learning MCMC kernels parameterized by neural networks was accepted to ICLR. Up to 106x ESS and improved posterior sampling for deep generative models. Paper: goo.gl/afzwVr Code: goo.gl/jCruwW cc: @GoogleBrain
  • user avatar
    First-order methods are great but we never know which one to use. In our paper (w/ John Duchi) arxiv.org/pdf/1909.10455, we tell you which one to use and when, depending on the quadratic convexity of the constraints. Also, adaptivity matters. To appear at #NeurIPS2019 as an oral.
  • user avatar
    Two papers on optimization with differential privacy accepted to #NeurIPS2021! In the 1st, with @SZiteng and collaborators at Google, we provide optimal algorithms to learn with *user-level* DP; a more stringent notion that protects a user's entire contribution (of many samples)
  • user avatar
    DRO: no-one knows what it does and it doesn't scale anyway... Or does it? In our #NeurIPS2020 paper, we propose optimization algorithms with running time independent of dimension and dataset size (think SGD for ERM) for CVaR and chi-square objectives. arxiv.org/abs/2010.05893 1/4
  • user avatar
    On my way to #ICLR2018! Will be presenting our work (with Matt Hoffman and @jaschasd) on generalizing HMC with neural networks. Come to the poster on Thursday! Code: github.com/brain-research… Paper: arxiv.org/abs/1711.09268 cc: @GoogleBrain
  • user avatar
    Just wrote a piece breaking down the extravagant toplaner @FnaticsOAZ and his raw talent! goldper10.com/article/534.ht…
  • user avatar
    Choosing the optimal gradient algorithm depending on the geometry is important. Interestingly, how to do it is in seminal results about the Gaussian Sequence model. Come to our oral at 4:50pm in West Exhibition Hall A! #NeurIPS2019
    First-order methods are great but we never know which one to use. In our paper (w/ John Duchi) arxiv.org/pdf/1909.10455, we tell you which one to use and when, depending on the quadratic convexity of the constraints. Also, adaptivity matters. To appear at #NeurIPS2019 as an oral.
  • user avatar
    New paper out on learning under *user*-level differential privacy constraints! arxiv.org/abs/2102.11845 In the standard DP setting, we implicitly assume that each user contributes a single sample but it turns out we often contribute many many samples (like all of our texts). 1/
  • user avatar
    The poster everyone has been waiting for will happen tomorrow (Wednesday) between 9-11am PST. Come say hi and learn the secret to robustness at scale! Paper: arxiv.org/abs/2010.05893 Gathertown: neurips.gather.town/app/xrip42gQ8g…
    DRO: no-one knows what it does and it doesn't scale anyway... Or does it? In our #NeurIPS2020 paper, we propose optimization algorithms with running time independent of dimension and dataset size (think SGD for ERM) for CVaR and chi-square objectives. arxiv.org/abs/2010.05893 1/4
    arXiv logo
    arxiv.org
    Large-Scale Methods for Distributionally Robust Optimization
    We propose and analyze algorithms for distributionally robust optimization of convex losses with conditional value at risk (CVaR) and $χ^2$ divergence uncertainty sets. We prove that our...
  • user avatar
    Just arrived to #AAAI2018! Will be presenting our work (with @ermonste) on sample-efficient policy optimization for discrete action spaces. Spotlight tomorrow at 2:30. Paper: arxiv.org/abs/1711.08068
  • user avatar
    GIF