2015
DOI: 10.3150/13-bej562
|View full text |Cite
|
Sign up to set email alerts
|

Lasso and probabilistic inequalities for multivariate point processes

Abstract: Due to its low computational cost, Lasso is an attractive regularization method for high-dimensional statistical settings. In this paper, we consider multivariate counting processes depending on an unknown function parameter to be estimated by linear combinations of a fixed dictionary. To select coefficients, we propose an adaptive $\ell_1$-penalization methodology, where data-driven weights of the penalty are derived from new Bernstein type inequalities for martingales. Oracle inequalities are established und… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
250
0
2

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 163 publications
(261 citation statements)
references
References 57 publications
4
250
0
2
Order By: Relevance
“…It is already known that this model can easily deal with more than two neurons (Daley & Vere-Jones, 2003;Pernice et al, 2011Pernice et al, , 2012Chornoboy et al, 1988). However, it is only in a recent work that we have proposed theoretical statistical methods to deal with several neurons and large delays of interaction through Lasso methods (Hansen et al, 2012). We aim at generalizing those results to non stationary data in time.…”
Section: Discussionmentioning
confidence: 99%
“…It is already known that this model can easily deal with more than two neurons (Daley & Vere-Jones, 2003;Pernice et al, 2011Pernice et al, , 2012Chornoboy et al, 1988). However, it is only in a recent work that we have proposed theoretical statistical methods to deal with several neurons and large delays of interaction through Lasso methods (Hansen et al, 2012). We aim at generalizing those results to non stationary data in time.…”
Section: Discussionmentioning
confidence: 99%
“…It is stressed that the originality of our work is that it takes advantage of the theory of stochastic processes to handle a functional data analysis problem-in that sense, it differs from other studies devoted to nonparametric estimation of Cox process intensity (see for instance Hansen et al, 2013, and the references therein).…”
Section: Functional Classification and Cox Processesmentioning
confidence: 99%
“…(24) shows that for all ε > 0 and for all starting points x ∈ R n+1 , the diffusion Y N , starting from Y N (0) = x, visits tubes B ε (Γ) = {y ∈ R n+1 : dist(y, Γ) < ε} infinitely often, almost surely. Moreover, for large N, the diffusion stays within such tubes around the limit cycle during long periods, before eventually leaving such a tube after a time which is of order e NV , whereV is related to the control problem of our diffusion and to the cost of steering the process from the limit cycle to the boundary of the tube around the limit cycle (see [30] for details).…”
Section: Some Easy Facts On the Diffusion Approximationmentioning
confidence: 99%
“…In particular, (24) shows how the invariant measure µ N of the diffusion approximation Y N concentrates around the periodic orbit Γ. To obtain (24) we rely on the approach of Freidlin and Wentzell [21] to sample path large deviations of diffusions, developed further in Dembo and Zeitouni [14] and extended to the case of degenerate diffusions in Rey-Bellet and Thomas [32]; we refer the interested reader to [30] for more details.…”
Section: Some Easy Facts On the Diffusion Approximationmentioning
confidence: 99%
See 1 more Smart Citation