Pith. sign in

REVIEW 5 major objections 6 minor 233 references

Pointwise convergence of purely random partition estimators: from random trees to prototype rules

T0 review · 5 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Shape regularity decides the pointwise rate of purely random partition estimators

desk verdict Solid new pointwise bounds for Proto-NN and OptiNet, with the main caveat that the minimax-optimality claims lean on the companion [BPS26] criterion rather than on proofs in this paper. read the letter →

arxiv 2608.08360 v1 pith:Q5URNFTB submitted 2026-08-08 math.ST stat.TH

Jérémy Bettinger , François Portier , Adrien Saumard This is my paper · ORCID
classification math.STstat.TH MSC 62G0862G20
keywords shape-regularitypurelyrandompartitionpointwiseconvergencerateMondriantreesProto-NNOptiNetminimaxVoronoicells
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper sets out to show that a single geometric condition—shape regularity, meaning $\operatorname{diam}(V)^d \leq \gamma \lambda(V)$ for the cell containing the query point—governs the pointwise convergence rate of every purely random partition estimator. A new finite-sample deviation inequality splits the pointwise error into a variance term driven by cell volume and a bias term driven by cell diameter, making the geometry of the cell the only quantity that decides the rate. Applying this criterion, the paper shows why centered and uniform trees underperform: on an event of positive probability their cells become exponentially elongated, so the best pointwise rates they can certify are $n^{-1/(d+2)}e^{2\sqrt{\log n\log\log n}}$ and $n^{-1/(\Theta d+2)}$ with $\Theta\approx 5.5$. Mondrian trees, whose splits adapt to the current side lengths, are shape-regular in probability and reach the minimax rate $n^{-1/(d+2)}$. The same analysis supplies the first pointwise concentration bounds for Proto-NN and shows that OptiNet reaches the minimax rate with much better probability, almost surely for a suitable parameter choice.

What carries the argument

The central object is shape regularity: a cell $V$ is $\gamma$-shape-regular whenever $\operatorname{diam}(V)^d \le \gamma\lambda(V)$, so its volume is comparable to the $d$-th power of its diameter. It is paired with a pointwise deviation inequality (Theorem 1) stating that, with probability at least $1-2\delta$, $|\hat g_V(x)-g(x)| \le \sqrt{2\sigma^2\log(1/\delta)/(nP_n(V(x)))}+L(V(x))\operatorname{diam}(V(x))$. When the cell is shape-regular and the design density is bounded below, the variance and bias terms balance at $\lambda(V(x))\asymp n^{-d/(d+2)}$, producing the minimax rate $n^{-1/(d+2)}$. The criterion becomes a classifier of rates because the paper imports the companion result that shape regularity is necessary and sufficient, up to logarithmic factors, for this minimax rate.

What would settle it

Find a purely random partition that is not shape-regular, so the cell aspect ratio grows without bound on a positive-probability event, but whose pointwise error on a fixed Lipschitz function is nevertheless $n^{-1/(d+2)}$ up to logarithmic factors; this would refute the necessity of shape regularity. A less decisive check is to simulate centered and uniform trees and estimate the exponent in $n^{1/(d+2)}|\hat g_V(x)-g(x)|$: the theory predicts growth like $e^{2\sqrt{\log n\log\log n}}$ for centered trees and like $n^{1/(d+2)-1/(\Theta d+2)}$ for uniform trees.

Watch

Extended reading notes

Core claim

The central claim is that shape regularity is not one more sufficient condition but the common mechanism: for purely random partitions, the pointwise rate is determined by whether the random construction keeps the cells from collapsing in some direction. The paper proves a general deviation bound, then establishes by explicit moment calculations that centered and uniform trees violate shape regularity on events of probability bounded away from zero, explaining the super-logarithmic corrections in their rates. It proves Mondrian trees are shape-regular in probability and therefore attain the minimax pointwise rate with probability at least $1-5\delta$. For Voronoi partitions, it proves Proto-NN attains the minimax rate when the number of prototypes is tuned as $m\asymp n^{d/(d+2)}(\log n)^{2/(d+2)}$, and that OptiNet attains the same rate, with an almost sure version when $\eta\asymp(\log n/n)^{1/(d+2)}$.

Load-bearing premise

The optimality conclusions rest on a companion theorem, imported without proof, that shape regularity is necessary as well as sufficient, up to logarithmic factors, for the pointwise minimax rate $n^{-1/(d+2)}$; if that necessity statement fails specifically for pointwise error, the claimed optimality of Mondrian, Proto-NN, and OptiNet does not follow from the proofs given here.

Editorial extensions

If this is right

  • Any purely random tree whose split direction is chosen independently of the current cell's side lengths will, with positive probability independent of $n$, produce a cell containing $x$ whose aspect ratio grows exponentially in $\sqrt{N/d}$, which is why centered and uniform trees cannot reach the minimax pointwise rate.
  • Mondrian trees attain the pointwise minimax rate $n^{-1/(d+2)}$ with probability at least $1-5\delta$, but the probability of the good event decays polynomially rather than exponentially, so an almost sure version is not available.
  • Proto-NN, for which convergence rates were previously open, attains the minimax pointwise rate when $m\asymp n^{d/(d+2)}\log(n)^{2/(d+2)}$, with a success probability whose scaling matches that of Mondrian trees.
  • OptiNet attains the same minimax rate and, with $\eta\asymp(\log n/n)^{1/(d+2)}$, does so almost surely, because the $\eta$-net spacing prevents the abnormally small Voronoi cells that degrade Proto-NN.
  • Across all constructions, the rate question reduces to one geometric check: does the partition keep $\operatorname{diam}(V)^d$ comparable to $\lambda(V)$?

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper: the same diagnostic could be applied to other blind-split ensembles, for instance random forests whose coordinate selection probabilities are fixed rather than side-length-weighted, predicting the same exponential aspect-ratio failure and hence the same type of rate degradation.
  • Beyond the paper: the small-cell event identified as the cause of poor probability scaling for Mondrian trees and Proto-NN suggests a concrete fix: enforce a minimum cell volume or prototype spacing in the spirit of OptiNet's $\eta$-net, and test whether the success probability becomes exponential.
  • Beyond the paper: if the imported necessity result is correct, a practical model-selection rule emerges—monitor the empirical aspect ratio of the cell containing each test point and reject partitions whose cells are not shape-regular, since those cannot be minimax pointwise.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 6 minor

Summary. The paper studies pointwise convergence rates of regression estimators based on purely random partitions: tree-based partitions (centered, uniform, Mondrian) and Voronoi-type prototype rules (Proto-NN and OptiNet). The main tool is a general finite-sample pointwise deviation bound (Theorem 1 and Corollary 2) that separates a variance term depending on the cell volume and a bias term depending on the cell diameter. The paper then analyzes the shape regularity of the cell containing the evaluation point in each construction. It proves that centered and uniform trees are not shape-regular on events of positive probability, that Mondrian trees are shape-regular with high probability and achieve n^{-1/(d+2)} rates, that Proto-NN admits the first pointwise concentration bounds at the minimax rate, and that OptiNet achieves the same rate with an almost sure guarantee under suitable parameter choices. Several optimality and impossibility claims are attributed to the companion preprint [BPS26], and one positive bound for the bias term is imported from [Por21].

Significance. If the imported necessity result from [BPS26] is valid in the pointwise sense used here, the paper provides a genuinely unifying geometric explanation for the different rates of random-partition estimators, and it resolves the open Proto-NN rate problem explicitly raised by Györfi and Weiss. The paper's own contributions are substantial: Corollary 2 is a clean and reusable pointwise concentration inequality; the Borel-Cantelli arguments for centered and uniform trees, the Paley-Zygmund lower bounds for aspect ratios, and the order-statistic analysis for Proto-NN are mostly self-contained and internally consistent; and the almost sure OptiNet rate is a strong, concrete result. The upper-bound halves of the tree results and the Proto-NN/OptiNet concentration bounds are proved rather than merely asserted.

major comments (5)
  1. [Section 2, Definition 3 and the paragraph before it; Abstract] The paper's central claim that shape regularity is necessary and sufficient, up to logarithmic factors, for the pointwise minimax rate is imported from the same-author companion preprint [BPS26] and is not proved in this manuscript. The present paper proves only upper bounds via Corollary 2 and its applications; no pointwise lower bound is proved for partitions that fail shape regularity. Therefore the statements that centered and uniform trees have 'unavoidable' super-logarithmic corrections (Propositions 7 and 12 and the discussion after Theorem 11) and that Mondrian trees, Proto-NN, and OptiNet 'attain the minimax rate' (Theorems 14, 16, and 17) are conditional on the necessity direction of [BPS26]. The authors should either state precisely which theorem of [BPS26] is being used and in which norm, prove the needed pointwise lower bound, or explicitly mark all optimality claims as conditional on the companion result.
  2. [Section 3.4, discussion after Theorem 14] The claim that the Mondrian rate 'cannot be extended to an almost sure convergence guarantee' is asserted without proof. Proposition 13 and Theorem 14 give only high-probability bounds with a δ-dependent regularity constant; they do not rule out the existence of a different argument yielding an almost sure rate. This negative claim is load-bearing because it is used to contrast Mondrian trees with OptiNet, so it needs a proof (for example, a quantitative lower bound on the probability of an abnormally small cell along a subsequence) or it should be removed and replaced by the weaker statement that the proof technique presented here does not yield an almost sure guarantee.
  3. [Section 3.3, Proposition 12 and the paragraph before it] Proposition 12 establishes non-shape-regularity only for a fixed cell constructed by a predetermined sequence of splits, not for the random cell V(x) containing the evaluation point x. The text explicitly acknowledges the difficulty ('we face a major difficulty due to x') but then concludes that uniform trees 'fundamentally fail to satisfy the shape regularity property' and uses this conclusion to support the claimed unavoidable rate degradation in Theorem 11. Since the pointwise analysis concerns V(x), a fixed-cell failure with positive probability does not by itself establish that V(x) is non-shape-regular on a positive-probability event. The authors should either prove the analogue for V(x) or clearly state that only the fixed-cell failure is established.
  4. [Section 3.4, Theorem 14 and surrounding text] The text says that Mondrian regression trees 'attain, with high probability, the minimax rate for the pointwise error in expectation,' but Theorem 14 is a high-probability bound at fixed δ, and the constant C depends on δ through c_{δ,d} and log(1/δ). With δ fixed the failure probability is a positive constant, and letting δ tend to zero makes the constant diverge as a power of 1/δ. No expectation bound is derived. If the claim is only a high-probability rate, the wording should be changed; if an expectation rate is intended, a tail integration argument with a quantitative treatment of the bad event is needed.
  5. [Section 4, Theorem 15 and Theorem 17] The bias bounds for Proto-NN and OptiNet rely on Lemma 3 of [Por21], a same-author preprint, without stating the lemma or reproducing its proof. This lemma is load-bearing because it controls the k-NN radius used to bound diam(V(x)), and Theorem 17 also invokes it directly. The authors should state the lemma or give a proof in an appendix, at least in the form needed for the present paper, so that the pointwise concentration claims are verifiable from this manuscript alone.
minor comments (6)
  1. [Section 3.2, Proposition 4 and Proposition 5] The notation 2^{±N/d ± 2√((d−1)N log N)/d^2} is typographically overloaded in the full text; the intended exponents should be set with parentheses so that the additive fluctuation is inside the exponent.
  2. [Section 3.3, Theorem 11] The exponent n^{-1/(Θd+2)} is ambiguous; it should be written n^{-1/(Θ d + 2)} with an explicit multiplication dot, and the value Θ ≈ 5.5 should be stated as (1+log 2)/(1−log 2).
  3. [Section 4, proof of Corollary 16] The sentence describing an 'identity' relating the variance term to (log(n/δ)/m)^{1/d} is not an identity; it is a consequence of the particular choice of m made in the corollary. The wording should be corrected.
  4. [Section 3.4, final paragraph] The reference to 'Proposition 22 in [BPS26]' is not accompanied by a statement of that proposition; since it is used to support the claim about structural sub-optimality, the authors should state the proposition or give a precise reference to its location in the companion paper.
  5. [Section 4, introduction of Proto-NN] The quotation from [GW21] concerns the Proto-NN classifier, while the present paper treats regression; the authors should clarify that the open problem they resolve is the regression analogue or the same problem in the regression setting, to avoid a mismatch between the quote and the result.
  6. [Throughout] There are several OCR-type artifacts in the displayed text (for example, missing multiplication symbols in exponents and equations such as 'n−1/(Θd+2)'); a careful copyedit of the mathematical notation is needed.

Circularity Check

2 steps flagged · score 4.0 of 10

Optimality and 'unavoidable sub-optimality' claims are inherited from the authors' companion [BPS26] necessity theorem rather than proved here; the paper's own concentration and geometry results are otherwise self-contained.

  1. self citation load bearing [Abstract; Section 1 (Introduction); Section 2 before Definition 3]
    "Our analysis rests on a single geometric criterion, shape regularity, relating the diameter of a cell to its volume, which is shown by Bettinger, Portier and Saumard (2026) to be necessary and sufficient, up to logarithmic factors, for achieving the minimax rate n^{-1/(d+2)}."

    The paper proves upper bounds (Corollary 2) and geometric facts (Propositions 4-13), but the statement that a partition estimator 'attains the minimax rate' requires a pointwise lower bound matching n^{-1/(d+2)}. No such lower bound is proved here; instead the paper imports the necessary-and-sufficient shape-regularity criterion from [BPS26], a companion preprint by the same three authors. Every 'minimax' conclusion (Theorems 14, 16, 17) and every 'unavoidable' correction claim (Propositions 7 and 12) inherits the necessity direction of that criterion. The central explanatory claim therefore reduces, for its lower-bound half, to a self-citation rather than to the present derivations.

  2. self citation load bearing [Section 3.4 (Mondrian trees), paragraph after Theorem 14]
    "The analysis of Section D in [BPS26] demonstrates that structural sub-optimality is inevitable when splitting directions are chosen independently of the cell's geometry."

    The paper's own Propositions 7 and 12 only establish that centered and uniform trees are not shape-regular with positive probability, namely that the aspect ratio grows exponentially on an event of probability bounded away from zero. Inferring from this that the degraded rates are 'inevitable', or that Mondrian's almost-sure rate cannot be improved, requires the companion's necessity theorem that non-shape-regularity forces sub-minimax rates. That theorem is not proved in this paper and is cited from a preprint by the same authors; absent a self-contained pointwise lower bound, the 'unavoidable' conclusion is an imported premise.

full rationale

The paper is not globally circular: Theorem 1 and Corollary 2 derive a pointwise concentration bound from sub-Gaussian and Lipschitz assumptions; Propositions 4-12 compute diameter, volume, or aspect-ratio bounds for the tree constructions; Proposition 13, Theorem 14, and Section 4 derive upper bounds for Mondrian, Proto-NN, and OptiNet; and the use of [Por21] is a parameter-free k-NN radius lemma whose assumptions do not include the target rates. The circularity burden is concentrated in the lower-bound and optimality half of the central claim: the paper repeatedly imports from [BPS26], a same-author companion preprint, the necessary-and-sufficient shape-regularity criterion. Theorems 14, 16, and 17 are upper-bound results labelled 'minimax'; they become optimality statements only when combined with that imported necessity direction. Propositions 7 and 12 show non-shape-regularity with positive probability, but the paper does not convert this into a pointwise lower bound; instead it quotes [BPS26, Section D] for 'inevitable' structural sub-optimality. Additionally, the sentence in Section 3.4 claiming that the Mondrian rate 'cannot be extended to an almost sure convergence guarantee' is stated without proof; I treat that as an evidence gap rather than as a circular step. These issues concern provenance and missing lower-bound arguments, not fitted parameters or definitional identity, so the score is 4 rather than 6 or higher.

Assumptions & free parameters 4 free parameters · 8 assumptions · 0 invented entities

All rate claims rest on standard i.i.d., sub-Gaussian, Lipschitz, and density assumptions, plus two imported geometric tools: the shape-regularity criterion from the same authors' companion preprint [BPS26] and the nearest-neighbor radius bound of [Por21]. No data are fitted; the tuning parameters N, m, Lambda, and eta are chosen analytically to balance variance and bias.

free parameters (4)
  • prototype count m = m approximately (n/c_delta)^(d/(d+2)) log(12n/delta)^(2/(d+2)) for Proto-NN
    The Proto-NN minimax bound holds only for m at this prescribed scaling; the rate is not claimed for arbitrary m.
  • OptiNet spacing eta = eta = (log(n)/n)^(1/(d+2)) for the almost sure rate
    Theorem 17 and the Borel-Cantelli argument require this choice to balance bias and variance.
  • Mondrian lifetime Lambda = Lambda approximately n^(1/(d+2))
    Theorem 14 requires this scaling; the constant depends on delta through c_delta,d.
  • tree depth N = N = d log n / ((d+2) log 2) for centered trees; N = d log n / C_d for uniform trees
    The rates in Theorems 6 and 11 depend on this particular choice of the number of splits.
assumptions (8)
  • domain assumption Assumption (D): (X,Y) and (X_i,Y_i) are i.i.d.
    Defines the regression setting in Section 2.
  • domain assumption Assumption (E)/(EZ): sub-Gaussian noise conditional on X and Z
    Used in Theorem 1, Corollary 2, and the Proto-NN bounds to control the variance term.
  • domain assumption Assumption (L): the regression function g is Lipschitz
    Drives the bias term diam(V(x)) in all rate results.
  • domain assumption Assumption (XTREE): covariate density bounded below on [0,1]^d
    Needed for the tree theorems to translate cell volume into empirical cell count.
  • domain assumption Assumptions (XZ)/(XNN): support regularity, density bounds, and local mass lower bound
    Used in the Proto-NN and OptiNet proofs to lower bound Voronoi cell volume and control k-NN radii.
  • domain assumption Shape-regularity criterion of [BPS26] is necessary and sufficient up to logarithmic factors for the minimax rate
    Imported from a same-author companion preprint; underpins the optimality claims in Theorems 14, 16, and 17. It is not re-proved here.
  • standard math Mondrian cell distribution characterization, [MGS19, Proposition 1]
    Used in Proposition 13 to obtain side-length tail bounds.
  • standard math Nearest-neighbor radius bound, Lemma 3 in [Por21]
    Used in Propositions 19 and Theorem 17 to bound the diameter of Voronoi cells.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Pointwise convergence of purely random partition estimators: from random trees to prototype rules." pith.science (2026). https://pith.science/paper/Q5URNFTB

@misc{pith2026260808360,
  author       = {Pith},
  title        = {Pith review of: Pointwise convergence of purely random partition estimators: from random trees to prototype rules},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Q5URNFTB}},
  note         = {Machine review of arXiv:2608.08360}
}
abstract

We study pointwise convergence rates of purely random partition estimators in nonparametric regression, where the partition -- into hyper-rectangles by purely random trees, or into Voronoi cells by prototype rules -- is built independently of the responses. Our analysis rests on a single geometric criterion, shape regularity, relating the diameter of a cell to its volume, which is shown by Bettinger, Portier and Saumard (2026) to be necessary and sufficient, up to logarithmic factors, for achieving the minimax rate $n^{-1/(d+2)}$. We show that centered and uniform trees are not shape-regular -- their cells' aspect ratio grows exponentially with the number of splits with probability bounded away from zero -- explaining the super-logarithmic corrections in their error bounds, whereas Mondrian trees, whose splits adapt to the current cell geometry, are shape-regular in probability and attain the minimax rate. The same analysis applied to Voronoi partitions yields the first pointwise concentration bounds for Proto-NN, resolving an open problem of Gy\"orfi and Weiss (2021), and shows that OptiNet achieves the minimax rate with markedly better success probability -- even almost surely, for a suitable choice of parameters -- thanks to its $\eta$-net construction.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

233 extracted references · 64 canonical work pages

  1. [1]

    Local Rademacher complexities , author=. Ann. Statist. , volume=. 2005 , publisher=

    2005

  2. [2]

    Journal of artificial intelligence research , volume=

    SMOTE: synthetic minority over-sampling technique , author=. Journal of artificial intelligence research , volume=

  3. [3]

    1996 , publisher=

    A probabilistic theory of pattern recognition , author=. 1996 , publisher=

    1996

  4. [4]

    Advances in neural information processing systems , volume=

    Mondrian forests: Efficient online random forests , author=. Advances in neural information processing systems , volume=

  5. [5]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    On error and compression rates for prototype rules , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  6. [6]

    Advances in Neural Information Processing Systems , volume=

    Rates of convergence for nearest neighbor classification , author=. Advances in Neural Information Processing Systems , volume=

  7. [7]

    2006 , publisher=

    A distribution-free theory of nonparametric regression , author=. 2006 , publisher=

    2006

  8. [8]

    The annals of statistics , pages=

    Optimal global rates of convergence for nonparametric regression , author=. The annals of statistics , pages=. 1982 , publisher=

    1982

Show all 233 references
  1. [9]

    arXiv preprint arXiv:1803.09655 , year=

    Bagan: Data augmentation with balancing gan , author=. arXiv preprint arXiv:1803.09655 , year=

    arXiv

  2. [10]

    Exploratory Undersampling for Class-Imbalance Learning , year=

    Liu, Xu-Ying and Wu, Jianxin and Zhou, Zhi-Hua , journal=. Exploratory Undersampling for Class-Imbalance Learning , year=

  3. [11]

    and Galar, M

    Triguero, I. and Galar, M. and Vluymans, S. and Cornelis, C. and Bustince, H. and Herrera, F. and Saeys, Y. , booktitle=. Evolutionary undersampling for imbalanced big data classification , year=

  4. [12]

    Electronic Journal of Statistics , number =

    Clayton Scott , title =. Electronic Journal of Statistics , number =. 2012 , doi =

    2012

  5. [13]

    Proceedings of the 30th International Conference on Machine Learning , pages =

    On the Statistical Consistency of Algorithms for Binary Classification under Class Imbalance , author =. Proceedings of the 30th International Conference on Machine Learning , pages =. 2013 , editor =

    2013

  6. [14]

    International Conference on Machine Learning , pages=

    Class-weighted classification: Trade-offs and robust approaches , author=. International Conference on Machine Learning , pages=. 2020 , organization=

    2020

  7. [15]

    Introduction to Statistical Learning Theory , author =

  8. [16]

    Classification in general finite dimensional spaces with the

    Gadat, S\'. Classification in general finite dimensional spaces with the. Ann. Statist. , FJOURNAL =. 2016 , NUMBER =

    2016

  9. [17]

    , title =

    Tsybakov, Alexandre B. , title =. 2008 , publisher =

    2008

  10. [18]

    Choice of neighbor order in nearest-neighbor classification , author=. Ann. Statist. , volume=

  11. [19]

    2021 , publisher=

    Mathematical foundations of infinite-dimensional statistical models , author=. 2021 , publisher=

    2021

  12. [20]

    An exponential inequality for the distribution function of the kernel density estimator, with applications to adaptive estimation , JOURNAL =

    Gin\'. An exponential inequality for the distribution function of the kernel density estimator, with applications to adaptive estimation , JOURNAL =. 2009 , NUMBER =

    2009

  13. [21]

    Nonparametric discrimination: Consistency properties , author=

    Discriminatory analysis. Nonparametric discrimination: Consistency properties , author=. Int. Stat. Rev. , volume=. 1951 , publisher=

    1951

  14. [22]

    Local nearest neighbour classification with applications to semi-supervised learning , author=. Ann. Statist. , volume=. 2020 , publisher=

    2020

  15. [23]

    Theory of classification: a survey of some recent advances , JOURNAL =

    Boucheron, St\'. Theory of classification: a survey of some recent advances , JOURNAL =. 2005 , PAGES =

    2005

  16. [24]

    Dudley, R. M. , TITLE =. J. Funct. Anal. , FJOURNAL =. 1967 , PAGES =

    1967

  17. [25]

    Hierarchical nearest-neighbor Gaussian process models for large geostatistical datasets , author=. J. Amer. Statist. Assoc. , volume=. 2016 , publisher=

    2016

  18. [26]

    Bousquet, Olivier , TITLE =. C. R. Math. Acad. Sci. Paris , FJOURNAL =. 2002 , NUMBER =

    2002

  19. [27]

    The Annals of Statistics , pages=

    Risk Bounds for Statistical Learning , author=. The Annals of Statistics , pages=. 2006 , publisher=

    2006

  20. [28]

    Journal of Combinatorial Theory, Series A , volume=

    Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension , author=. Journal of Combinatorial Theory, Series A , volume=. 1995 , publisher=

    1995

  21. [29]

    The Annals of Probability , volume=

    About the constants in Talagrand's concentration inequalities for empirical processes , author=. The Annals of Probability , volume=. 2000 , publisher=

    2000

  22. [30]

    2023 , publisher=

    Mathematical analysis of machine learning algorithms , author=. 2023 , publisher=

    2023

  23. [31]

    Lecture Notes (Princeton University) , year=

    Probability in high dimension , author=. Lecture Notes (Princeton University) , year=

  24. [32]

    1991 , publisher=

    Probability in Banach Spaces: isoperimetry and processes , author=. 1991 , publisher=

    1991

  25. [33]

    Consistency of a recursive nearest neighbor regression function estimate , author=. J. Multivariate Anal. , volume=. 1980 , publisher=

    1980

  26. [34]

    The strong uniform consistency of nearest neighbor density estimates , author=. Ann. Statist. , pages=. 1977 , publisher=

    1977

  27. [35]

    Empirical Risk Minimization under Random Censorship , author=. J. Mach. Learn. Res. , volume=

  28. [36]

    Smooth regression analysis , author=. Sankhy. 1964 , publisher=

    1964

  29. [37]

    Theory Probab

    On estimating regression , author=. Theory Probab. Appl. , volume=. 1964 , publisher=

    1964

  30. [38]

    Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test , author=. Ann. Probab. , pages=. 1983 , publisher=

    1983

  31. [39]

    On the measure of Voronoi cells , author=. J. Appl. Probab. , FJOURNAL =. 2017 , publisher=

    2017

  32. [40]

    Bernoulli , volume=

    Integral approximation by kernel smoothing , author=. Bernoulli , volume=. 2016 , publisher=

    2016

  33. [41]

    AISTATS proceedings , pages=

    Nearest Neighbour Based Estimates of Gradients: Sharp Nonasymptotic Bounds and Applications , author=. AISTATS proceedings , pages=. 2021 , organization=

    2021

  34. [42]

    On the strong universal consistency of nearest neighbor regression function estimates , author=. Ann. Statist. , pages=. 1994 , publisher=

    1994

  35. [43]

    Rate of convergence of k -nearest-neighbor classification rule , author=. J. Mach. Learn. Res. , volume=. 2017 , publisher=

    2017

  36. [44]

    Electron

    A nearest neighbor estimate of the residual variance , author=. Electron. J. Stat. , volume=. 2018 , publisher=

    2018

  37. [45]

    1966 , PAGES =

    Royall, Richard Miles , TITLE =. 1966 , PAGES =

    1966

  38. [46]

    Principles of nonparametric learning , pages=

    Pattern classification and learning theory , author=. Principles of nonparametric learning , pages=. 2002 , publisher=

    2002

  39. [47]

    Statistics & Probability Letters , volume=

    Uniform concentration bounds for frequencies of rare events , author=. Statistics & Probability Letters , volume=. 2022 , publisher=

    2022

  40. [48]

    Estimation of a conditional copula and association measures , author=. Scand. J. Stat. , volume=. 2011 , publisher=

    2011

  41. [49]

    1981 , journal=

    Nonparametric regression with randomly censored survival data , author=. 1981 , journal=

    1981

  42. [50]

    IEEE Trans

    Estimation by the nearest neighbor rule , author=. IEEE Trans. Inform. Theory , volume=. 1968 , publisher=

    1968

  43. [51]

    Robust nonparametric regression with simultaneous scale curve estimation , author=. Ann. Statist. , pages=. 1988 , publisher=

    1988

  44. [52]

    The rate of convergence of k_n -

    Gy. The rate of convergence of k_n -. IEEE Trans. Inform. Theory , volume=. 1981 , publisher=

    1981

  45. [53]

    Asymptotic normality of multivariate k -

    Mack, YP , journal=. Asymptotic normality of multivariate k -. 1980 , number =

    1980

  46. [54]

    Statistical Decision Theory and Related Topics , pages=

    Large sample properties of nearest neighbor density function estimators , author=. Statistical Decision Theory and Related Topics , pages=. 1977 , publisher=

    1977

  47. [55]

    IEEE Trans

    The uniform convergence of nearest neighbor regression function estimators and their application in optimization , author=. IEEE Trans. Inform. Theory , volume=. 1978 , publisher=

    1978

  48. [56]

    arXiv preprint arXiv:2110.15083 , year=

    Nearest neighbor process: weak convergence and non-asymptotic bound , author=. arXiv preprint arXiv:2110.15083 , year=

    arXiv

  49. [57]

    Pattern Classification and Learning Theory

    Lugosi, G. Pattern Classification and Learning Theory. Principles of Nonparametric Learning. 2002

    2002

  50. [58]

    1990 , publisher=

    Applied nonparametric regression , author=. 1990 , publisher=

    1990

  51. [59]

    Conference on Learning Theory , pages=

    Learning the dependence structure of rare events: a non-asymptotic study , author=. Conference on Learning Theory , pages=. 2015 , organization=

    2015

  52. [60]

    A result of

    Anthony, Martin and Shawe-Taylor, John , journal=. A result of. 1993 , publisher=

    1993

  53. [61]

    Sharper bounds for Gaussian and empirical processes , author=. Ann. Probab. , pages=. 1994 , publisher=

    1994

  54. [62]

    Plassier, Vincent and Portier, Francois and Segers, Johan , TITLE =. Ann. Inst. Henri Poincar\'. 2023 , NUMBER =

    2023

  55. [63]

    Electron

    Partial and average copulas and association measures , author=. Electron. J. Stat. , volume=. 2015 , publisher=

    2015

  56. [64]

    Computational Statistics & Data Analysis , volume=

    Nonparametric estimation of pair-copula constructions with the empirical pair-copula , author=. Computational Statistics & Data Analysis , volume=. 2015 , publisher=

    2015

  57. [65]

    simplifying

    About tests of the “simplifying” assumption for conditional copulas , author=. Dependence Modeling , volume=. 2017 , publisher=

    2017

  58. [66]

    Asymptotics of conditional empirical processes , author=. J. Multivariate Anal. , volume=. 1988 , publisher=

    1988

  59. [67]

    Local properties of k -

    Mack, Yue-Pok , journal=. Local properties of k -. 1981 , publisher=

    1981

  60. [68]

    NeurIPS proceedings , pages=

    Distance metric learning for large margin nearest neighbor classification , author=. NeurIPS proceedings , pages=

  61. [69]

    Conditional Empirical Processes , author=. Ann. Statist. , volume=. 1986 , publisher=

    1986

  62. [70]

    Strong uniform consistency rates for estimators of conditional functionals , author=. Ann. Statist. , pages=. 1988 , publisher=

    1988

  63. [71]

    NeurIPS proceedings , volume=

    Rates of Convergence for Large-scale Nearest Neighbor Classification , author=. NeurIPS proceedings , volume=

  64. [72]

    Journal of Multivariate Analysis , volume=

    On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification , author=. Journal of Multivariate Analysis , volume=. 2010 , publisher=

    2010

  65. [73]

    , author=

    On the Rate of Convergence of the Bagged Nearest Neighbor Estimate. , author=. J. Mach. Learn. Res. , volume=

  66. [74]

    Test , volume=

    Test of independence and randomness based on the empirical copula process , author=. Test , volume=. 2004 , publisher=

    2004

  67. [75]

    Lectures on the nearest neighbor method , SERIES =

    Biau, G\'. Lectures on the nearest neighbor method , SERIES =. 2015 , PAGES =

    2015

  68. [76]

    Non-asymptotic uniform rates of consistency for k -

    Jiang, Heinrich , booktitle=. Non-asymptotic uniform rates of consistency for k -

  69. [77]

    Wiley Interdisciplinary Reviews: Computational Statistics , volume=

    On nonparametric conditional independence tests for continuous variables , author=. Wiley Interdisciplinary Reviews: Computational Statistics , volume=. 2020 , publisher=

    2020

  70. [78]

    Probability Theory and Related Fields , volume=

    An estimate on the supremum of a nice class of stochastic integrals and U-statistics , author=. Probability Theory and Related Fields , volume=. 2006 , publisher=

    2006

  71. [79]

    Some special

    Wenocur, Roberta S and Dudley, Richard M , journal=. Some special. 1981 , publisher=

    1981

  72. [80]

    NeurIPS proceedings , pages=

    Learning graphical models with Mercer kernels , author=. NeurIPS proceedings , pages=

  73. [81]

    Biometrics , pages=

    Two guidelines for bootstrap hypothesis testing , author=. Biometrics , pages=. 1991 , publisher=

    1991

  74. [82]

    Consistent nonparametric regression , author=. Ann. Statist. , volume=. 1977 , publisher=

    1977

  75. [83]

    Journal of Theoretical Probability , volume=

    An empirical process approach to the uniform consistency of kernel-type function estimators , author=. Journal of Theoretical Probability , volume=. 2000 , publisher=

    2000

  76. [84]

    2015 , publisher=

    Principles of copula theory , author=. 2015 , publisher=

    2015

  77. [85]

    Neuroimage , volume=

    Benchmarking functional connectome-based predictive models for resting-state fMRI , author=. Neuroimage , volume=. 2019 , publisher=

    2019

  78. [86]

    Nature communications , volume=

    Development of the social brain from age three to twelve years , author=. Nature communications , volume=. 2018 , publisher=

    2018

  79. [87]

    Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=

    Variable selection via additive conditional independence , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2016 , publisher=

    2016

  80. [88]

    2018 , publisher=

    Sufficient dimension reduction: Methods and applications with R , author=. 2018 , publisher=

    2018

  81. [89]

    Asymptotic normality of nonparametric tests for independence , author=. Ann. Statist. , pages=. 1974 , publisher=

    1974

  82. [90]

    Asymptotic distributions of multivariate rank order statistics , author=. Ann. Statist. , pages=. 1976 , publisher=

    1976

  83. [91]

    Journal of Business & Economic Statistics , volume=

    Nonparametric copula-based test for conditional independence with applications to Granger causality , author=. Journal of Business & Economic Statistics , volume=. 2012 , publisher=

    2012

  84. [92]

    Asymptotic normality of multivariate linear rank statistics in the non-iid case , author=. Ann. Statist. , pages=. 1978 , publisher=

    1978

  85. [93]

    Sparse graphical models for exploring gene expression data , author=. J. Multivariate Anal. , volume=. 2004 , publisher=

    2004

  86. [94]

    , author=

    Rates of convergence for the cluster tree. , author=. NeurIPS proceedings , pages=

  87. [95]

    BMC bioinformatics , volume=

    Inferring cellular networks--a review , author=. BMC bioinformatics , volume=. 2007 , publisher=

    2007

  88. [96]

    Applied Psychological Measurement , volume=

    Conditional independence in a clustered item test , author=. Applied Psychological Measurement , volume=. 1988 , publisher=

    1988

  89. [97]

    A test of the conditional independence assumption in sample selection models , author=. J. of Appl. Econometrics , volume=. 2015 , publisher=

    2015

  90. [98]

    Statistics and Computing , volume=

    Control variate selection for Monte Carlo integration , author=. Statistics and Computing , volume=. 2021 , publisher=

    2021

  91. [99]

    Monte Carlo and Quasi-Monte Carlo Methods , pages=

    Some results on the complexity of numerical integration , author=. Monte Carlo and Quasi-Monte Carlo Methods , pages=. 2016 , publisher=

    2016

  92. [100]

    Monte Carlo integration with a growing number of control variates , author=. J. Appl. Probab. , FJOURNAL =. 2019 , publisher=

    2019

  93. [101]

    2017 , url =

    R: A Language and Environment for Statistical Computing , author =. 2017 , url =

    2017

  94. [102]

    On the weak convergence of the empirical conditional copula under a simplifying assumption , author=. J. Multivariate Anal. , volume=. 2018 , publisher=

    2018

  95. [103]

    Statistics & probability letters , volume=

    A note on bootstrap approximations for the empirical copula process , author=. Statistics & probability letters , volume=. 2010 , publisher=

    2010

  96. [104]

    Bernoulli , volume=

    Weak convergence of empirical copula processes , author=. Bernoulli , volume=. 2004 , publisher=

    2004

  97. [105]

    , author=

    Rank correlation methods. , author=. 1948 , publisher=

    1948

  98. [106]

    Testing for equality between two copulas , author=. J. Multivariate Anal. , volume=. 2009 , publisher=

    2009

  99. [107]

    Bernoulli , volume=

    Asymptotics of empirical copula processes under non-restrictive smoothness assumptions , author=. Bernoulli , volume=. 2012 , publisher=

    2012

  100. [108]

    An asymptotic decomposition for multivariate distribution-free tests of independence , author=. J. Multivariate Anal. , volume=. 1981 , publisher=

    1981

  101. [109]

    The Annals of mathematical Statistics , pages=

    A non-parametric test of independence , author=. The Annals of mathematical Statistics , pages=. 1948 , publisher=

    1948

  102. [110]

    and Gijbels, I

    Veraverbeke, N. and Gijbels, I. and Omelka, M. , year =. Pre-adjusted nonparametric estimation of a conditional distribution function , journal =

  103. [111]

    Deheuvels, Paul , TITLE =. Acad. Roy. Belg. Bull. Cl. Sci. (5) , FJOURNAL =. 1979 , NUMBER =

    1979

  104. [112]

    , year =

    Lambert, P. , year =. Archimedean copula estimation using. Computational Statistics and Data Analysis , volume =

  105. [113]

    2011 , author =

    Estimation of a conditional copula and association measures , journal =. 2011 , author =

    2011

  106. [114]

    Families of m -variate distributions with given margins and m(m-1)/2 bivariate dependence parameters , editor =

    Joe, Harry , year =. Families of m -variate distributions with given margins and m(m-1)/2 bivariate dependence parameters , editor =. Distributions with Fixed Marginals and Related Topics , address =

  107. [115]

    Bernoulli , volume =

    Parameter estimation for pair-copula constructions , author =. Bernoulli , volume =. 2013 , pages =

    2013

  108. [116]

    Simplified pair copula constructions—Limitations and extensions

    Jakob Stöber and Harry Joe and Claudia Czado. Simplified pair copula constructions—Limitations and extensions. J. Multivariate Anal. 2013

    2013

  109. [117]

    On the simplified pair-copula construction -- Simply useful or too simplistic?

    Hobaek Haff , Ingrid and Aas, Kjersti and Frigessi, Arnoldo. On the simplified pair-copula construction -- Simply useful or too simplistic?. J. Multivariate Anal. 2010

    2010

  110. [118]

    2011 , note =

    Bergsma, Wicher , title =. 2011 , note =

    2011

  111. [119]

    and Omelka, M

    Gijbels, I. and Omelka, M. and N. Veraverbeke , year =. Partial and average copulas and association measures , journal =

  112. [120]

    2011 , author =

    Conditional copulas, association measures and their applications , journal =. 2011 , author =

    2011

  113. [121]

    Acar and Christian Genest and Johanna Ne s lehov\'a

    Elif F. Acar and Christian Genest and Johanna Ne s lehov\'a. Beyond simplified pair-copula constructions. J. Multivariate Anal. 2012

    2012

  114. [122]

    Masry, Elias , TITLE =. J. Time Ser. Anal. , FJOURNAL =. 1996 , NUMBER =

    1996

  115. [123]

    Fonctions de r

    Sklar, M , year=. Fonctions de r

  116. [124]

    On the asymptotics of

    Portier, Fran. On the asymptotics of. Electron. J. Stat. , VOLUME =. 2016 , NUMBER =

    2016

  117. [125]

    Fan, Jianqing , TITLE =. J. Amer. Statist. Assoc. , FJOURNAL =. 1992 , NUMBER =

    1992

  118. [126]

    , TITLE =

    Stone, Charles J. , TITLE =. Ann. Statist. , VOLUME =. 1977 , NUMBER =

    1977

  119. [127]

    and Czado, C

    Aas, K. and Czado, C. and Frigessi, A. and Bakken, H. , year =. Pair-copula constructions of multiple dependence , journal =

  120. [128]

    Strong uniform consistency rates for estimators of conditional functionals , JOURNAL =

    H. Strong uniform consistency rates for estimators of conditional functionals , JOURNAL =. 1988 , NUMBER =

    1988

  121. [129]

    Estimating regression functions and their derivatives by the kernel method , JOURNAL =

    Gasser, Theo and M. Estimating regression functions and their derivatives by the kernel method , JOURNAL =. 1984 , NUMBER =

    1984

  122. [130]

    International Economic Review , volume=

    Modelling asymmetric exchange rate dependence , author=. International Economic Review , volume=. 2006 , publisher=

    2006

  123. [131]

    Portier, François , year = 2023, title =

    2023

  124. [132]

    Akritas, Michael G. and. Non-parametric estimation of the residual distribution , journal =

  125. [133]

    and Cooke, R.M

    Bedford, T. and Cooke, R.M. , year =. Vines--a new graphical model for dependent random variables , journal =

  126. [134]

    Uniform Consistency of the Kernel Conditional Kaplan-Meier Estimate , author=. Ann. Statist. , volume=. 1989 , publisher=

    1989

  127. [135]

    An empirical process approach to the uniform consistency of kernel-type function estimators , author=. J. Theoret. Probab. , volume=. 2000 , publisher=

    2000

  128. [136]

    and Gijbels, I

    Fan, J. and Gijbels, I. , TITLE =. 1996 , PAGES =

    1996

  129. [137]

    Nonparametric estimation of pair-copula constructions with the empirical pair-copula , year =

  130. [138]

    Austrian Journal of Statistics , year=

    Uniform in bandwidth consistency of local polynomial regression function estimators , author=. Austrian Journal of Statistics , year=

  131. [139]

    2015 , author =

    Nonparametric estimation of pair-copula constructions with the empirical pair-copula , journal =. 2015 , author =

    2015

  132. [140]

    arXiv preprint arXiv:1407.3939 , year=

    Analysis of purely random forests bias , author=. arXiv preprint arXiv:1407.3939 , year=

    arXiv

  133. [141]

    2000 , institution=

    Some infinity theory for predictor ensembles , author=. 2000 , institution=

    2000

  134. [142]

    Technical Report 670, University of California, Berkeley , volume=

    Consistency for a simple model of random forests , author=. Technical Report 670, University of California, Berkeley , volume=. 2004 , publisher=

    2004

  135. [143]

    Machine learning , volume=

    Random forests , author=. Machine learning , volume=. 2001 , publisher=

    2001

  136. [144]

    Consistency of Random Forests and Other Averaging Classifiers , journal =

    G. Consistency of Random Forests and Other Averaging Classifiers , journal =. 2008 , volume =

    2008

  137. [145]

    , TITLE =

    Talagrand, M. , TITLE =. Ann. Probab. , VOLUME =. 1994 , NUMBER =

    1994

  138. [146]

    arXiv preprint arXiv:1804.07203 , year=

    The Hardness of Conditional Independence Testing and the Generalised Covariance Measure , author=. arXiv preprint arXiv:1804.07203 , year=

    arXiv

  139. [147]

    Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=

    Panning for gold:‘model-X’knockoffs for high dimensional controlled variable selection , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , volume=. 2018 , publisher=

    2018

  140. [148]

    Journal of the Royal Statistical Society: Series B (Statistical Methodology) , year=

    The conditional permutation test for independence while controlling for confounders , author=. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , year=

  141. [149]

    Segers, Johan , TITLE =. J. Statist. Plann. Inference , VOLUME =. 2015 , PAGES =

    2015

  142. [150]

    and Gijbels, I

    Omelka, M. and Gijbels, I. and Veraverbeke, N. , title =. Ann. Statist. , year =

  143. [151]

    and Gijbels, I

    Veraverbeke, N. and Gijbels, I. and Omelka, M. , TITLE =. Journal of the Royal Statistical Society. Series B. Statistical Methodology , VOLUME =. 2014 , NUMBER =

    2014

  144. [152]

    , year =

    Ojeda, J.L. , year =. H\"older continuity properties of the local polynomial estimator , institution =

  145. [153]

    Journal of Econometrics , volume=

    Smooth minimum distance estimation and testing with conditional estimating equations: uniform in bandwidth theory , author=. Journal of Econometrics , volume=. 2013 , publisher=

    2013

  146. [154]

    Nonparametric model checks for regression , author=. Ann. Statist. , pages=. 1997 , publisher=

    1997

  147. [155]

    Local efficiency of a Cram

    Genest, Christian and Quessy, Jean-Fran. Local efficiency of a Cram. J. Multivariate Anal. , volume=. 2006 , publisher=

    2006

  148. [156]

    arXiv preprint arXiv:2008.09480 , year=

    Conditional empirical copula processes and generalized dependence measures , author=. arXiv preprint arXiv:2008.09480 , year=

    2008 arXiv

  149. [157]

    Estimation of a copula when a covariate affects only marginal distributions , JOURNAL =

    Gijbels, Ir. Estimation of a copula when a covariate affects only marginal distributions , JOURNAL =. 2015 , NUMBER =. doi:10.1111/sjos.12154 , URL =

    2015 doi

  150. [158]

    Lopez, Olivier , TITLE =. Comm. Statist. Theory Methods , VOLUME =. 2011 , NUMBER =

    2011

  151. [159]

    High dimensional probability II , pages=

    Preservation theorems for Glivenko-Cantelli and uniform Glivenko-Cantelli classes , author=. High dimensional probability II , pages=. 2000 , publisher=

    2000

  152. [160]

    and Wellner, Jon A

    Van Der Vaart, Aad W. and Wellner, Jon A. , TITLE =. Asymptotics: particles, processes and inverse problems , SERIES =

  153. [161]

    IEEE Trans

    Nearest neighbor pattern classification , author=. IEEE Trans. Inform. Theory , volume=. 1967 , publisher=

    1967

  154. [162]

    Econometric Theory , volume=

    Uniform convergence rates for kernel estimation with dependent data , author=. Econometric Theory , volume=. 2008 , publisher=

    2008

  155. [163]

    1996 , journal =

    New Concentration Inequalities in Product Spaces , author =. 1996 , journal =

    1996

  156. [164]

    On consistency of kernel density estimators for randomly censored data: rates holding uniformly over adaptive intervals , JOURNAL =

    Gin\'. On consistency of kernel density estimators for randomly censored data: rates holding uniformly over adaptive intervals , JOURNAL =. 2001 , NUMBER =

    2001

  157. [165]

    Uniform central limit theorems for kernel density estimators , JOURNAL =

    Gin. Uniform central limit theorems for kernel density estimators , JOURNAL =. 2008 , NUMBER =

    2008

  158. [166]

    , TITLE =

    Tsybakov, Alexandre B. , TITLE =

  159. [167]

    , TITLE =

    Kosorok, Michael R. , TITLE =. 2008 , PAGES =

    2008

  160. [168]

    Van Der Vaart, A. W. , TITLE =

  161. [169]

    Dudley, R. M. , TITLE =. Ann. Probab. , FJOURNAL =. 1992 , NUMBER =

    1992

  162. [170]

    Asymptotic methods in probability and statistics (

    Ghoudi, Kilani and Remillard, Bruno , TITLE =. Asymptotic methods in probability and statistics (

  163. [171]

    Dudley, R. M. , TITLE =. 1999 , PAGES =

    1999

  164. [172]

    Kernel-Based Conditional Independence Test and Application in Causal Discovery , year =

    Zhang, Kun and Peters, Jonas and Janzing, Dominik and Sch\". Kernel-Based Conditional Independence Test and Application in Causal Discovery , year =. AUAI Proceedings , pages =

  165. [173]

    AISTATS proceedings , pages=

    Conditional independence testing based on a nearest-neighbor estimator of conditional mutual information , author=. AISTATS proceedings , pages=. 2018 , organization=

    2018

  166. [174]

    , author=

    A Permutation-Based Kernel Conditional Independence Test. , author=. UAI , pages=

  167. [175]

    Journal of Econometrics , volume=

    A consistent characteristic function-based test for conditional independence , author=. Journal of Econometrics , volume=. 2007 , publisher=

    2007

  168. [176]

    Econometric Theory , volume=

    A nonparametric Hellinger metric test for conditional independence , author=. Econometric Theory , volume=. 2008 , publisher=

    2008

  169. [177]

    1995 , author=

    Probability and measure. 1995 , author=. John Wiley&Sons, New York , year=

    1995

  170. [178]

    Available at SSRN 1702981 , year=

    Nonparametric testing of conditional independence by means of the partial copula , author=. Available at SSRN 1702981 , year=

  171. [179]

    Nonparametric tests of independence between random vectors , author=. J. Multivariate Anal. , volume=. 2007 , publisher=

    2007

  172. [180]

    Tests of independence among continuous random vectors based on

    Kojadinovic, Ivan and Holmes, Mark , journal=. Tests of independence among continuous random vectors based on. 2009 , publisher=

    2009

  173. [181]

    Dependence Modeling , volume=

    Testing the symmetry of a dependence structure with a characteristic function , author=. Dependence Modeling , volume=. 2018 , publisher=

    2018

  174. [182]

    Joint European Conference on Machine Learning and Knowledge Discovery in Databases , pages=

    Permutation testing improves Bayesian network learning , author=. Joint European Conference on Machine Learning and Knowledge Discovery in Databases , pages=. 2010 , organization=

    2010

  175. [183]

    NeurIPS proceedings , pages=

    Model-powered conditional independence test , author=. NeurIPS proceedings , pages=

  176. [184]

    Dimensionality reduction for supervised learning with reproducing kernel Hilbert spaces , author=. J. Mach. Learn. Res. , volume=

  177. [185]

    Journal of the Royal Statistical Society: Series B (Methodological) , volume=

    Conditional independence in statistical theory , author=. Journal of the Royal Statistical Society: Series B (Methodological) , volume=. 1979 , publisher=

    1979

  178. [186]

    Advances in Neural Information Processing Systems , pages=

    A kernel statistical test of independence , author=. Advances in Neural Information Processing Systems , pages=

  179. [187]

    2009 , publisher=

    Probabilistic graphical models: principles and techniques , author=. 2009 , publisher=

    2009

  180. [188]

    1998 , publisher=

    Learning in graphical models , author=. 1998 , publisher=

    1998

  181. [189]

    2004 , doi =

    Introduction to Statistical Learning Theory , author =. 2004 , doi =

    2004

  182. [190]

    Concentration inequalities

    Boucheron, St\'. Concentration inequalities. A nonasymptotic theory of independence , PUBLISHER =. 2013 , PAGES =

    2013

  183. [191]

    Econometrica , volume=

    Semiparametric Estimation of Index Coefficients , author=. Econometrica , volume=. 1989 , publisher=

    1989

  184. [192]

    Dalalyan and Anatoly Juditsky and Vladimir Spokoiny , title =

    Arnak S. Dalalyan and Anatoly Juditsky and Vladimir Spokoiny , title =. JMLR , year =

  185. [193]

    IEEE Transactions on Neural Networks , year =

    Chunhua Shen and Junae Kim and Lei Wang , title =. IEEE Transactions on Neural Networks , year =

  186. [194]

    Journal of Multivariate Analysis , volume=

    The Law of the Iterated Logarithm for the Multivariate Nearest Neighbor Density Estimators , author=. Journal of Multivariate Analysis , volume=. 1995 , publisher=

    1995

  187. [195]

    The Annals of Statistics , year =

    Gabor Lugosi and Andrew Nobel , title =. The Annals of Statistics , year =

  188. [196]

    Devroye , title =

    Luc P. Devroye , title =. The Canadian Journal of Statistics , year =

  189. [197]

    TMLR , year=

    On the Sample Complexity of Lipschitz Constant Estimation , author=. TMLR , year=

  190. [198]

    Bernoulli , year =

    François Portier , title =. Bernoulli , year =

  191. [199]

    Annals of Statistics , volume=

    Consistency of random forests , author=. Annals of Statistics , volume=

  192. [200]

    Journal of Multivariate Analysis , volume=

    Erwan Scornet , title =. Journal of Multivariate Analysis , volume=

  193. [201]

    Some nonparametric multivariate procedures based on statistically equivalent blocks , author=

  194. [202]

    Journal of Multivariate Analysis , volume=

    Almost surely consistent nonparametric regression from recursive partitioning schemes , author=. Journal of Multivariate Analysis , volume=. 1984 , publisher=

    1984

  195. [203]

    Journal of Multivariate Analysis , volume=

    Consistent nonparametric regression from recursive partitioning schemes , author=. Journal of Multivariate Analysis , volume=. 1980 , publisher=

    1980

  196. [204]

    The Annals of Statistics , pages=

    Asymptotically efficient solutions to the classification problem , author=. The Annals of Statistics , pages=. 1978 , publisher=

    1978

  197. [205]

    IEEE Trans

    A recursive partitioning decision rule for nonparametric classification , author=. IEEE Trans. Computers , volume=

  198. [206]

    The Annals of Statistics , pages=

    Distribution-free consistency results in nonparametric discrimination and regression function estimation , author=. The Annals of Statistics , pages=. 1980 , publisher=

    1980

  199. [207]

    Kpotufe, Samory , booktitle=. k-

  200. [208]

    International Conference on Artificial Intelligence and Statistics , pages=

    Sharp analysis of a simple model for random forests , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2021 , organization=

    2021

  201. [209]

    arXiv preprint arXiv:2211.10805 , year=

    On the pointwise behavior of recursive partitioning and its implications for heterogeneous causal effect estimation , author=. arXiv preprint arXiv:2211.10805 , year=

    arXiv

  202. [210]

    On the convergence of

    Mazumder, Rahul and Wang, Haoyue , journal=. On the convergence of

  203. [211]

    The Annals of Statistics , volume=

    Asymptotic properties of high-dimensional random forests , author=. The Annals of Statistics , volume=. 2022 , publisher=

    2022

  204. [212]

    Rates of strong uniform consistency for multivariate kernel density estimators , NOTE =

    Gin. Rates of strong uniform consistency for multivariate kernel density estimators , NOTE =. Ann. Inst. Henri Poincar\'. 2002 , NUMBER =

    2002

  205. [213]

    and Pollard, D

    Nolan, D. and Pollard, D. , TITLE =. Ann. Statist. , VOLUME =. 1987 , NUMBER =

    1987

  206. [214]

    , TITLE =

    Einmahl, Uwe and Mason, David M. , TITLE =. J. Funct. Anal. , VOLUME =. 2000 , NUMBER =

    2000

  207. [215]

    and Wellner, Jon A

    Van Der Vaart, Aad W. and Wellner, Jon A. , TITLE =. 1996 , PAGES =

    1996

  208. [216]

    Near-optimal sample compression for nearest neighbors , volume =

    Gottlieb, Lee-Ad and Kontorovich, Aryeh and Nisnevitch, Pinhas , booktitle =. Near-optimal sample compression for nearest neighbors , volume =

  209. [217]

    Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions , url =

    Kontorovich, Aryeh and Sabato, Sivan and Weiss, Roi , booktitle =. Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions , url =

  210. [218]

    arXiv preprint arXiv:2606.28641 , volume=

    Revisiting local regression: shape regularity, uniform rates, and the limits of random splits , author=. arXiv preprint arXiv:2606.28641 , volume=. 2026 , publisher=

    2026 arXiv

  211. [219]

    2017 , eprint=

    Achieving the time of 1 -NN, but the accuracy of k -NN , author=. 2017 , eprint=

    2017

  212. [220]

    ESAIM: Probability and Statistics

    Nearest neighbor classification in infinite dimension , author=. ESAIM: Probability and Statistics. , year=. doi:10.1051/ps:2006014

    doi

  213. [221]

    Roy, Daniel M and Teh, Yee W , booktitle=. The

  214. [222]

    arXiv preprint arXiv:1405.0352 , year=

    Asymptotic theory for random forests , author=. arXiv preprint arXiv:1405.0352 , year=

    arXiv

  215. [223]

    Journal of the American Statistical Association , volume=

    Estimation and inference of heterogeneous treatment effects using random forests , author=. Journal of the American Statistical Association , volume=. 2018 , publisher=

    2018

  216. [224]

    1984 , publisher=

    Classification and Regression Trees , author=. 1984 , publisher=

    1984

  217. [225]

    Advances in Neural Information Processing Systems 30 , year=

    Universal consistency and minimax rates for online Mondrian Forests , author=. Advances in Neural Information Processing Systems 30 , year=

  218. [226]

    The Annals of Statistics , year =

    Andrew Nobel , title =. The Annals of Statistics , year =

  219. [227]

    Information processing letters , volume=

    A guided tour of Chernoff bounds , author=. Information processing letters , volume=. 1990 , publisher=

    1990

  220. [228]

    Annals of Statistics , number =

    Minimax optimal rates for Mondrian trees and forests , author=. Annals of Statistics , number =

  221. [229]

    Vapnik, V. N. and Chervonenkis, A. Ya. , TITLE =. Measures of complexity , PAGES =

  222. [230]

    The Annals of Statistics , volume=

    Universal Bayes consistency in metric spaces , author=. The Annals of Statistics , volume=. 2021 , publisher=

    2021

  223. [231]

    Journal of Machine Learning Research , volume=

    Universal consistency and rates of convergence of multiclass prototype algorithms in metric spaces , author=. Journal of Machine Learning Research , volume=

  224. [232]

    The Journal of Machine Learning Research , volume=

    Analysis of a random forests model , author=. The Journal of Machine Learning Research , volume=. 2012 , publisher=

    2012

  225. [233]

    Test , volume=

    A random forest guided tour , author=. Test , volume=. 2016 , publisher=

    2016

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.