The light bulb problem
Ramamohan Paturi,Sanguthevar Rajasekaran,John H. Reif +2 more
- 01 Dec 1989
- pp 261-268
36
TL;DR: The problem of correlational learning is considered and efficient algorithms to determine correlated objects are presented and it is shown that correlation among correlated objects is positively correlated.
read more
Abstract: In this paper, we consider the problem of correlational learning and present efficient algorithms to determine correlated objects.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
TL;DR: Two algorithms for the approximate nearest neighbor problem in high dimensional spaces for data sets of size n living in IR are presented, achieving query times that are sub-linear in n and polynomial in d.
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Alexandr Andoni,Piotr Indyk +1 more
- 21 Oct 2006
TL;DR: An algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O and space O almost matches the lower bound for hashing-based algorithm recently obtained in [27].
•Dissertation
Nearest neighbor search : the old, the new, and the impossible
Alexandr Andoni
- 01 Jan 2009
TL;DR: This thesis gives a new algorithm for the approximate NN problem in the d-dimensional Euclidean space, and gives an evidence that the classical approaches to NN under certain hard distances, such as the string edit distance, are likely to fail.
129
Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas
Gregory Valiant
- 20 Oct 2012
TL;DR: In this paper, the authors present an algorithm for learning sparse parities with noise with high probability in time complexity of O(n 2 + ϵ(n ϵ+ ϵ)-poly(n) poly(n), where ϵ is the Euclidean distance of the vectors.
Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem
TL;DR: Bucketing information is defined, and is proven to bound the performance of all bucketing codes, and it is shown that order of 1/p+∈comparisons suffice, for any ∈ > 0
73
References
Bootstrap Methods: Another Look at the Jackknife
TL;DR: In this article, the authors discuss the problem of estimating the sampling distribution of a pre-specified random variable R(X, F) on the basis of the observed data x.
•Book
The jackknife, the bootstrap, and other resampling plans
Bradley Efron
- 01 Jan 1987
TL;DR: The Delta Method and the Influence Function Cross-Validation, Jackknife and Bootstrap Balanced Repeated Replication (half-sampling) Random Subsampling Nonparametric Confidence Intervals as mentioned in this paper.
9K
A theory of the learnable
Leslie G. Valiant
- 05 Nov 1984
TL;DR: This paper regards learning as the phenomenon of knowledge acquisition in the absence of explicit programming, and gives a precise methodology for studying this phenomenon from a computational viewpoint.
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
Prabhakar Raghavan
- 27 Oct 1986
TL;DR: A methodology for converting a probabilistic existence proof to a deterministic approximation algorithm that mimics the existence proof in a very strong sense is developed.
404
•Proceedings Article
Functionality in neural nets
Leslie G. Valiant
- 21 Aug 1988
TL;DR: It is hypothesised that in this context functionality is limited more by the communication bottlenecks in the networks than by the computing capabilities of the elements and hence that this approach may prove useful in understanding biological systems even in the absence of accurate neurophysiological models.
66