Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Property testing and its connection to learning and approximation

- Oded Goldreich, S. Goldwasser, D. Ron
- Computer Science, Mathematics
- JACM
- 1 July 1998

In this paper, we consider the question of determining whether a function <italic>f</italic> has property P or is ε-far from any function with property P. A <italic>property testing</italic>… Expand

The power of amnesia: Learning probabilistic automata with variable memory length

- D. Ron, Y. Singer, Naftali Tishby
- Computer Science
- Machine Learning
- 1 December 1996

We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic finite automata which we name… Expand

Property Testing in Bounded Degree Graphs

- Oded Goldreich, D. Ron
- Mathematics, Computer Science
- STOC
- 4 May 1997

We further develop the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron. Loosely speaking, given an oracle access to a graph, we wish to distinguish the case when the… Expand

On the learnability of discrete distributions

- M. Kearns, Y. Mansour, D. Ron, R. Rubinfeld, R. Schapire, Linda Sellie
- Computer Science
- STOC '94
- 23 May 1994

We introduce and investigate a new model of learning probability distributions from independent draws. Our model is inspired by the popular Probably Approximately Correct (PAC) model for learning… Expand

On Testing Expansion in Bounded-Degree Graphs

- Oded Goldreich, D. Ron
- Mathematics, Computer Science
- Studies in Complexity and Cryptography
- 2000

We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or… Expand

On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms

- Michal Parnas, D. Ron
- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 1 August 2007

For a given graph G over n vertices, let OPT"G denote the size of an optimal solution in G of a particular minimization problem (e.g., the size of a minimum vertex cover). A randomized algorithm will… Expand

Property Testing in Bounded Degree Graphs

- Oded Goldreich, D. Ron
- Computer Science, Mathematics
- STOC '97
- 1 February 2002

AbstractWe further develop the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron. Loosely speaking, given an oracle access to a graph, we wish to distinguish the case… Expand

The Power of Amnesia

- D. Ron, Y. Singer, Naftali Tishby
- Computer Science
- NIPS
- 29 November 1993

We propose a learning algorithm for a variable memory length Markov process. Human communication, whether given as text, handwriting, or speech, has multi characteristic time scales. On short scales… Expand

Tolerant property testing and distance approximation

- Michal Parnas, D. Ron, R. Rubinfeld
- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1 September 2006

In this paper we study a generalization of standard property testing where the algorithms are required to be more tolerant with respect to objects that do not have, but are close to having, the… Expand

Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation

In this article we prove sanity-check bounds for the error of the leave-oneout cross-validation estimate of the generalization error: that is, bounds showing that the worst-case error of this… Expand