Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

138277415553 · Jun 202019922001200920172026
48 results for testing limits

The paper classifies and computes limits of equivariant compactifications of groups.

problem Classifying and computing limits of equivariant compactifications of groups.
method Equivariant normal R-test configurations and semistable limits.
result Semistable limits of K-unstable Fano group compactifications are computed.

Meta two-sample testing uses auxiliary data to quickly find powerful tests from limited samples.

problem Challenges in identifying powerful kernels for distinguishing complex distributions with limited data.
method Introduces meta two-sample testing (M2ST) to leverage abundant auxiliary data on related tasks.
result Proposed algorithms improve over baselines and identify powerful tests from scarce observations.

Testing independence is of significant interest in many important areas of large-scale inference. Using extreme-value form statistics to test against sparse alternatives and using quadratic form statistics to test against dense alternatives are two important testing procedures for high-dimensional independence. However…

2015-12-30abs ↗pdf ↗

The statistical analysis of discrete data has been the subject of extensive statistical research dating back to the work of Pearson. In this survey we review some recently developed methods for testing hypotheses about high-dimensional multinomials. Traditional tests like the χ2χ^2 test and the likelihood ratio test ca…

2017-12-17abs ↗pdf ↗

New method tests conditional independence using spectral representations.

problem Untestable conditional independence in many settings.
method Spectral representations of partial covariance operators, bi-level contrastive learning.
result Asymptotic validity and power guarantees for CI testing.

High-dimensional U-statistics show surprising phase transitions, impacting kernel-based tests.

problem Understanding phase transitions in high-dimensional U-statistics.
method Proved a convergence theorem for U-statistics of degree two in high dimensions.
result High-dimensional U-statistics can have non-Gaussian limits with larger variance and asymmetry.

Given a polarized complex manifold, projection of a torus-equivariant test configuration to holomorphic vector fields was introduced by G. Székelyhidi, as the limit of the associated C\mathbb{C}^*-actions. We show that there actually holds the moment convergence of the weight distributions. Our analytic approach at th…

2016-10-23abs ↗pdf ↗

Study phase transitions in identifying infected individuals using group testing.

problem Identifying a set of k infected individuals from a population using pooled tests.
method Two random assignment designs (constant-column and Bernoulli) and polynomial-time inference procedures.
result Sharp phase transitions in statistical and computational limits for detection and recovery problems.

Kernel tests assess equivalence between distributions without assuming specific moments.

problem Traditional goodness-of-fit tests fail to detect meaningful distributional differences.
method Proposes kernel-based tests using kernel Stein discrepancy and Maximum Mean Discrepancy.
result Tests assess the absence of meaningful distributional differences under controlled error rates.

In this paper, we consider a framework adapting the notion of cointegration when two asset prices are generated by a driftless Itô-semimartingale featuring jumps with infinite activity, observed regularly and synchronously at high frequency. We develop a regression based estimation of the cointegrated relations method …

2019-05-17abs ↗pdf ↗

The study connects K-stability and large complex structure limits in mirror symmetry.

problem Understanding K-stability and its relation to large complex structure limits in mirror symmetry.
method Analyzing Kähler test configurations and their mirror Landau-Ginzburg models, studying scaling behavior, and focusing on specific limiting cases.
result New formulae for the Donaldson-Futaki invariant are derived in terms of theta functions on the mirror in certain limiting cases.

Derives ideal train/test split for ridge regression in large data limit.

problem Finding optimal train/test split for ridge regression in large data scenarios.
method Mathematical derivation of optimal train/test split, considering ridge tuning parameter and asymptotic behavior.
result The optimal train/test split for ridge regression in the large data limit depends weakly on the ridge tuning parameter alpha.

Infinitesimal boosting converges to a deterministic process in large sample limit.

problem Characterizing the asymptotic behavior of infinitesimal gradient boosting in large sample sizes.
method Proving convergence to a deterministic process using large sample theory and differential equations.
result The test error decreases over time in the population limit.

Discusses MultiFIT for multivariate dependence, comparing it to HSIC tests.

problem Comparing Multiscale Fisher's Independence Test (MultiFIT) to HSIC tests for multivariate dependence.
method Compares MultiFIT to HSIC tests, highlighting exact level control and performance limitations.
result Observes performance limitations of MultiFIT in terms of test power.

Develops CLTs for Markov chain transition probabilities and policies.

problem Estimating transition probabilities and policies in controlled Markov chains.
method Non-parametric estimator for transition matrices; CLTs for value, Q-, and advantage functions; goodness-of-fit tests.
result Asymptotic normality of estimators under specific logging policies.

Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints - i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predic…

2016-10-06abs ↗pdf ↗

We develop a pivotal test to assess the statistical significance of the feature variables in a single-layer feedforward neural network regression model. We propose a gradient-based test statistic and study its asymptotics using nonparametric techniques. Under technical conditions, the limiting distribution is given by …

2019-02-16abs ↗pdf ↗

New methods cluster and test graphs without vertex correspondence.

problem Clustering and testing of networks without vertex correspondence.
method Inspired by graphon estimation, propose a novel graph distance and clustering algorithms.
result Prove statistical consistency of clustering algorithms under Lipschitz assumptions on graph degrees.

In this paper we consider a Lagrange Multiplier-type test (LM) to detect change in the mean of time series with heteroskedasticity of unknown form. We derive the limiting distribution under the null, and prove the consistency of the test against the alternative of either an abrupt or smooth changes in the mean. We perf…

2011-02-26abs ↗pdf ↗

Hypothesis testing for graphs has been an important tool in applied research fields for more than two decades, and still remains a challenging problem as one often needs to draw inference from few replicates of large graphs. Recent studies in statistics and learning theory have provided some theoretical insights about …

2018-11-30abs ↗pdf ↗

Paper proposes an intelligent credit limit management system using causal inference.

problem Traditional credit limit management strategies are heuristic and not data-driven.
method Conditional independence testing, response model, log transformation, GBDT encoding, non-linear transformation on features, well-designed metric.
result The proposed approach effectively manages credit limits and incorporates diminishing marginal effects.

Accurate goodness-of-fit tests for the extreme tails of empirical distributions is a very important issue, relevant in many contexts, including geophysics, insurance, and finance. We have derived exact asymptotic results for a generalization of the large-sample Kolmogorov-Smirnov test, well suited to testing these extr…

2012-07-31abs ↗pdf ↗

The paper explores statistical limits for detecting correlation in tree structures.

problem Detecting correlation between two tree structures.
method Investigates conditions for existence of one-sided tests in the limit of large tree depth.
result Identifies a phase transition at correlation parameter s=αs = \sqrt{α}, where tests exist for s>αs > \sqrt{α}.

Best-of-\infty improves LLM performance by efficiently allocating inference-time computation.

problem Achieving optimal performance in test-time LLM ensembling with infinite budget.
method Adaptive generation scheme and weighted ensembles of LLMs, formulated as mixed-integer linear program.
result Optimal ensemble weighting improves performance over individual models.

The theory of acceptance sets and their associated risk measures plays a key role in the design of capital adequacy tests. The objective of this paper is to investigate, in the context of bounded financial positions, the class of surplus-invariant acceptance sets. These are characterized by the fact that acceptability …

2014-01-14abs ↗pdf ↗

Optimal distributed testing under communication constraints with shared randomness.

problem Signal detection in a distributed system with limited communication.
method Derivation of minimax testing errors, distributed testing algorithms, and theoretical lower bounds.
result Consistent nonparametric distributed testing is possible even with minimal communication.

Study reveals limits of detecting local geometry in random graphs.

problem Detecting local geometry in random graphs with hidden communities.
method Introduced model and used information-theoretic and computational limits to investigate detection.
result Detection threshold determined at d=Θ~(k2k6/n3)d = \widetildeΘ(k^2 \vee k^6/n^3) for fixed pp.

Proposes a modified Morgan-Pitman test for evaluating variances in machine learning models.

problem Limited ability to account for sampling variability in model selection.
method Enhances the classic Morgan-Pitman test for robustness in non-linear models with heavy-tailed distributions or outliers.
result Demonstrates the test's effectiveness and practical utility in model evaluation and selection.

New findings control FDR for online testing methods under positive dependence.

problem Maintaining FDR control for online testing methods under positive dependence.
method Developed new methods to control FDR for online testing procedures under positive dependence.
result SAFFRON and LORD control FDR under positive dependence, not just conditional superuniformity.

A fundamental problem in network data analysis is to test Erdös-Rényi model G(n,a+b2n)\mathcal{G}\left(n,\frac{a+b}{2n}\right) versus a bisection stochastic block model G(n,an,bn)\mathcal{G}\left(n,\frac{a}{n},\frac{b}{n}\right), where a,b>0a,b>0 are constants that represent the expected degrees of the graphs and nn denotes the number o…

2018-07-12abs ↗pdf ↗