Elena Grigorescu
Statistical Learning Theory · 2012–2017
A researcher in the Science corpus: 2 papers; trusts 4 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Subfields
- Statistical Learning Theory — 6 citations into it
Whom Elena Grigorescu trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Leslie G. Valiant
- Michael Kearns
- Vladimir Naumovich Vapnik
- Frank McSherry
- Peter L. Bartlett
- Jacob Steinhardt
- Arthur P. Dempster
- Avrim Blum
Who trusts Elena Grigorescu overall
Papers from Elena Grigorescu's perspective
Ordered by how strongly the researchers Elena Grigorescu trusts endorse each paper. Same corpus, a different order for every researcher.
- Efficient noise-tolerant learning from statistical queries
- Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper
- Spectral partitioning of random graphs (Proceedings IEEE International Conference on Cluster Computing)
- Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
- A theory of the learnable
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis
- Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
- Information-theoretic lower bounds for distributed statistical estimation with communication constraints
- Monte Carlo Sampling Methods Using Markov Chains and Their Applications
- Some optimal inapproximability results
Their papers
- Statistical algorithms and a lower bound for detecting planted cliques (2012) — 247 citations
- Communication-Efficient Distributed Learning of Discrete Distributions (2017) — 34 citations