Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Miles Lopes

dblp:11/11107 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Information theory · 41% Mathematical optimization · 32% Algorithms and data structures · 27%
Artificial intelligence
2 papers
Learning theory · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
high-dimensional regression
0.212014
A Residual Bootstrap for High-Dimensional Regression with Near Low-Rank Designs · NIPS 2014
Information theory › signal processing
compressed sensing
0.212013
Estimating Unknown Sparsity in Compressed Sensing · ICML (3) 2013
Algorithms and data structures › numerical linear algebra › randomized numerical linear algebra
matrix rank estimation
0.212013
Estimating Unknown Sparsity in Compressed Sensing · ICML (3) 2013
Mathematical optimization › continuous optimization › matrix optimization
matrix recovery
0.212013
Estimating Unknown Sparsity in Compressed Sensing · ICML (3) 2013
Information theory › signal processing › compressed sensing
sparsity estimation
0.212013
Estimating Unknown Sparsity in Compressed Sensing · ICML (3) 2013
Machine learning › Learning theory
hypothesis testing
0.112011
A More Powerful Two-Sample Test in High Dimensions using Random Projection · NIPS 2011
Mathematical optimization
high-dimensional statistics
0.122014
A Residual Bootstrap for High-Dimensional Regression with Near Low-Rank Designs · NIPS 2014
A More Powerful Two-Sample Test in High Dimensions using Random Projection · NIPS 2011
Algorithms and data structures
randomized algorithms
0.012013
Estimating Unknown Sparsity in Compressed Sensing · ICML (3) 2013

Methods — techniques the papers use, named apart from their topics

residual bootstrap · 0.4random projection · 0.2hotelling t-squared statistic · 0.2minimax risk analysis · 0.2confidence intervals · 0.2
YearPublicationVenuePosition
2014 A Residual Bootstrap for High-Dimensional Regression with Near Low-Rank Designs
Miles Lopes
NIPS1
2013 Estimating Unknown Sparsity in Compressed Sensing
abstract
In the theory of compressed sensing (CS), the sparsity \|x\|_0 of the unknown signal x∈\R^p is commonly assumed to be a known parameter. However, it is typically unknown in practice. Due to the fact that many aspects of CS depend on knowing \|x\|_0, it is important to estimate this parameter in a data-driven way. A second practical concern is that \|x\|_0 is a highly unstable function of x. In particular, for real signals with entries not exactly equal to 0, the value \|x\|_0=p is not a useful description of the effective number of coordinates. In this paper, we propose to estimate a stable measure of sparsity s(x):=\|x\|_1^2/\|x\|_2^2, which is a sharp lower bound on \|x\|_0. Our estimation procedure uses only a small number of linear measurements, does not rely on any sparsity assumptions, and requires very little computation. A confidence interval for s(x) is provided, and its width is shown to have no dependence on the signal dimension p. Moreover, this result extends naturally to the matrix recovery setting, where a soft version of matrix rank can be estimated with analogous guarantees. Finally, we show that the use of randomized measurements is essential to estimating s(x). This is accomplished by proving that the minimax risk for estimating s(x) with deterministic measurements is large when n≪p.
Miles Lopes
ICML (3)1
2011 A More Powerful Two-Sample Test in High Dimensions using Random Projection
abstract
We consider the hypothesis testing problem of detecting a shift between the means of two multivariate normal distributions in the high-dimensional setting, allowing for the data dimension p to exceed the sample size n. Our contribution is a new test statistic for the two-sample test of means that integrates a random projection with the classical Hotelling T squared statistic. Working within a high- dimensional framework that allows (p,n) to tend to infinity, we first derive an asymptotic power function for our test, and then provide sufficient conditions for it to achieve greater power than other state-of-the-art tests. Using ROC curves generated from simulated data, we demonstrate superior performance against competing tests in the parameter regimes anticipated by our theoretical results. Lastly, we illustrate an advantage of our procedure with comparisons on a high-dimensional gene expression dataset involving the discrimination of different types of cancer.
Miles Lopes, Laurent Jacob, Martin J. Wainwright
NIPS1