Results 1  10
of
211,925
High dimensional graphs and variable selection with the Lasso
 ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract

Cited by 736 (22 self)
 Add to MetaCart
joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.
WideArea Traffic: The Failure of Poisson Modeling
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1995
"... Network arrivals are often modeled as Poisson processes for analytic simplicity, even though a number of traffic studies have shown that packet interarrivals are not exponentially distributed. We evaluate 24 widearea traces, investigating a number of widearea TCP arrival processes (session and con ..."
Abstract

Cited by 1775 (24 self)
 Add to MetaCart
with fixed hourly rates, but that other connection arrivals deviate considerably from Poisson; that modeling TELNET packet interarrivals as exponential grievously underestimates the burstiness of TELNET traffic, but using the empirical Tcplib [Danzig et al, 1992] interarrivals preserves burstiness over many
The Capacity of LowDensity ParityCheck Codes Under MessagePassing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract

Cited by 574 (9 self)
 Add to MetaCart
exponentially fast in the length of the code with arbitrarily small loss in rate.) Conversely, transmitting at rates above this capacity the probability of error is bounded away from zero by a strictly positive constant which is independent of the length of the code and of the number of iterations performed
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 416 (37 self)
 Add to MetaCart
to the language L. It was previously suspected (and proved in a relativized sense) that coNPcomplete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having twoprover interactive proof systems is nondeterministic exponential time. After the recent results
Determining Lyapunov Exponents from a Time Series
 Physica
, 1985
"... We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence of n ..."
Abstract

Cited by 495 (1 self)
 Add to MetaCart
We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence
Clustering with Bregman Divergences
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... A wide variety of distortion functions are used for clustering, e.g., squared Euclidean distance, Mahalanobis distance and relative entropy. In this paper, we propose and analyze parametric hard and soft clustering algorithms based on a large class of distortion functions known as Bregman divergence ..."
Abstract

Cited by 443 (57 self)
 Add to MetaCart
generalizing the basic idea to a very large class of clustering loss functions. There are two main contributions in this paper. First, we pose the hard clustering problem in terms of minimizing the loss in Bregman information, a quantity motivated by ratedistortion theory, and present an algorithm to minimize
Iterative Learning Control for Discrete Time Systems with Exponential Rate of Convergence
, 1995
"... An algorithm for Iterative Learning Control is proposed based on an optimization principle used by other authors to derive gradient type algorithms. The new algorithm is a descent algorithm and has potential benefits which include realization in terms of Riccati feedback and feedforward components. ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
. This realization also has the advantage of implicitly ensuring automatic step size selection and hence guaranteeing convergence without the need for empirical choice of parameters. The algorithm achieves a geometric rate of convergence for invertible plants. One important feature of the proposed algorithm
A Parallel Repetition Theorem
 SIAM Journal on Computing
, 1998
"... We show that a parallel repetition of any twoprover oneround proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previously known. The constant in the exponent (in our analysis) depends only on the original probability of error and on the t ..."
Abstract

Cited by 362 (9 self)
 Add to MetaCart
We show that a parallel repetition of any twoprover oneround proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previously known. The constant in the exponent (in our analysis) depends only on the original probability of error
THE FREQUENCY DISTRIBUTION OF SPONTANEOUS BACTERIOPHAGE MUTANTS AS EVIDENCE FOR THE EXPONENTIAL RATE OF PHAGE REPRODUCTION
"... The phage geneticist is faced with the task of constructing a satisfactory model of phage reproduction, in the absence of direct morphological evidence similar to the one available to the macrogeneticist. Cell division, mitosis, meiosis, fertilization have a solid basis of morphological observat ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
The phage geneticist is faced with the task of constructing a satisfactory model of phage reproduction, in the absence of direct morphological evidence similar to the one available to the macrogeneticist. Cell division, mitosis, meiosis, fertilization have a solid basis of morphological observation that the modern geneticist takes for granted. The virologist, on the other hand, begins where the cytogeneticist ends; in a sense, he deals directly with the units of genetic material whose existence the macrogeneticists (including the bacterial geneticists) must infer. Here lies his weakness, since little is known of the performance of such unitsand also his strength, since he can manipulate this subcytological world. He is not limited to dealing with integrated units of reproduction at the cellular level, but can control to a certain extent what goes into his cells. Because of this, virology's methods may lead more directly to solving the problem of the mode of replication of genetic material. Penetration of one phage particle into a susceptible bacterium leads to production of a large number of similar particles. The intervening steps are unknown. We conjecture a reorganization of the viral material, because of its nonrecoverability in infectious form early after penetration (Doermann, 1948). We conjecture an integration of the viral material into the cell machinery at the genetic level (Luria and Human, 1950), because cell syntheses are redirected toward the production of virus specific substances. The genetic complexities of bacteriophage tell us that the viral specificities to be replicated are multiple (Hershey, 1946b) and that the new virus may receive imprints from more than one viral ancestor within the same cell
Results 1  10
of
211,925