10.9k citations
- SLAC National Accelerator LaboratoryUS846 papers
- Kavli Institute for Particle Astrophysics and CosmologyUS782 papers
- University of California, BerkeleyUS392 papers
- Centre National de la Recherche ScientifiqueFR381 papers
- California Institute of TechnologyUS379 papers
- Massachusetts Institute of TechnologyUS305 papers
- University of Maryland, College ParkUS268 papers
- Lawrence Berkeley National LaboratoryUS257 papers
- University of MichiganUS252 papers
- University of ChicagoUS234 papers
- Goddard Space Flight CenterUS227 papers
- Princeton UniversityUS222 papers
174 papers · 1 filter
The Quantitative Reasoning for College Science (QuaRCS) Assessment, 1: Development and Validation
Katherine B. Follette, Donald W. McCarthy, Erin Dokter +2
Science is an inherently quantitative endeavor, and general education science courses are taken by a majority of college students. As such, they are a powerful venue for advancing…
Making Digital Artifacts on the Web Verifiable and Reliable
Tobias Kuhn, Michel Dumontier
The current Web has no general mechanisms to make digital artifacts --- such as datasets, code, texts, and images --- verifiable and permanent. For digital artifacts that are suppo…
Network Lasso: Clustering and Optimization in Large Graphs
David Hallac, Jure Leskovec, Stephen Boyd
Convex optimization is an essential tool for modern data analysis, as it provides a framework to formulate and solve many problems in machine learning and data mining. However, gen…
Inferring Networks of Substitutable and Complementary Products
Julian McAuley, Rahul Pandey, Jure Leskovec
In a modern recommender system, it is important to understand how products relate to each other. For example, while a user is looking for mobile phones, it might make sense to reco…
An Empirical Study of Stochastic Variational Algorithms for the Beta Bernoulli Process
Amar Shah, David A. Knowles, Zoubin Ghahramani
Stochastic variational inference (SVI) is emerging as the most promising candidate for scaling inference in Bayesian probabilistic models to large datasets. However, the performanc…
Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
Roy Frostig, Rong Ge, Sham M. Kakade +1
We develop a family of accelerated stochastic algorithms that minimize sums of convex functions. Our algorithms improve upon the fastest running time for empirical risk minimizatio…