Study anti-invariant submersions from holomorphic statistical manifolds.
problem Understanding submersions in statistical manifolds.
method Introduced and analyzed anti-invariant holomorphic statistical submersions.
result Supported results with examples.
A condition for a statistical manifold to have an equiaffine structure is studied. The facts that dual flatness and conjugate symmetry of a statistical manifold are sufficient conditions for a statistical manifold to have an equiaffine structure were obtained in [2] and [3]. In this paper, a fact that a statistical man…
We study lightlike submanifolds of indefinite statistical manifolds. Contrary to the classical theory of submanifolds of statistical manifolds, lightlike submanifolds of indefinite statistical manifolds need not to be statistical submanifold. Therefore we obtain some conditions for a lightlike submanifold of indefinite…
Sharp statistical theory for conditional diffusion models.
problem Lack of theoretical foundation for conditional diffusion models.
method Sharp statistical theory with approximation of conditional score function.
result Sample complexity bound that adapts to data distribution smoothness.
This paper studies the geometry of immersions into statistical manifolds. A necessary and sufficient condition is obtained for statistical manifold structures to be dual to each other for a non-degenerate equiaffine immersion. Then we obtain conditions for realizing an n-dimensional statistical manifold in an (n+1)-dim…
A new test statistic measures discrepancy between conditional distributions.
problem Measuring the discrepancy between two conditional distributions.
method Proposes a Bregman matrix divergence-based statistic that avoids explicit distribution estimation.
result The new statistic inherits high-order statistics and demonstrates utility in multi-task learning, concept drift detection, and feature selection.
NCP uses neural networks to efficiently learn conditional distributions.
problem Learning conditional distributions for statistical inference.
method Neural Conditional Probability (NCP) approach.
result NCP efficiently handles complex probability distributions and matches leading methods.
New test for conditional independence using GNNs avoids estimating conditional distributions.
problem Testing conditional independence of X and Y given Z. method Proposes a non-parametric testing procedure using GNNs to sample from marginal conditional distributions.
result Test statistic is doubly robust against GNN approximation errors.
New test for conditional independence using kernel embeddings.
problem Testing conditional independence in high-dimensional settings.
method Analytic kernel embeddings, asymptotic distribution.
result New test outperforms existing methods in high-dimensional settings.
Enhances selective inference for generalized lasso using parametric programming.
problem Low statistical power in selective inference for generalized lasso.
method Parametric programming to compute solution paths and identify model selection events.
result Improves selective inference power and practicality for various problems.
A new method tests conditional independence by transforming it into an unconditional problem using transport maps.
problem Testing conditional independence between two random vectors given a third.
method Constructing transport maps to transform conditional independence into unconditional independence, estimating these maps from data using conditional continuous normalizing flow models.
result The proposed method is validated through simulations and real-data analysis, demonstrating practical effectiveness.
Paper establishes identifiability conditions for a model with two latent vectors and auxiliary data.
problem Identifying conditions for a statistical model with two latent vectors and auxiliary data.
method Proposes a statistical model with two latent vectors and auxiliary data, establishing various identifiability conditions.
result Identifiability conditions reveal a dimensionality relation and link model indeterminacies to maximum link weights.
The paper analyzes Tikhonov regularization in Hilbert scales for statistical inverse problems.
problem Statistical inverse problems in Hilbert scales with general noise.
method Tikhonov regularization scheme with conditional stability estimates and high probability error bounds.
result Explicit rates of convergence for oversmoothing and regular cases over defined regularity classes.
Paper introduces a new measure of conditional dependence avoiding matrix inversions.
problem Measuring conditional dependence between two phenomena influenced by a confounder.
method Uses U-statistics pruning to avoid matrix inversions and re-interpret independence.
result Proposes a novel measure of conditional dependence that avoids matrix inversions.
Affine and conformal submersions with horizontal distribution are studied in statistical manifolds.
problem Characterizing submersions and geodesics in statistical manifolds.
method Introducing conformal submersions with horizontal distribution and proving conditions for statistical manifold properties.
result Necessary and sufficient conditions for submersions and geodesics in statistical manifolds.
The paper explores Kähler and anti-Kähler structures on quasi-statistical manifolds.
problem Investigating Kähler and anti-Kähler structures on quasi-statistical manifolds.
method Analyzing conditions for integrability of almost complex structures and defining Kähler and anti-Kähler manifolds.
result Conditions for (Nˊ,h,abla,L) to be an anti-Kähler manifold are identified. The condition for the curvature of a statistical manifold to admit a kind of standard hypersurface is given. We study the statistical hypersurfces of some types of the statistical manifolds (M,∇,g), which enable (M,∇(α),g),∀α∈R to admit the structure of a constant curvature.
Proposes a new method to analyze the distributional effects of treatments.
problem Analyzing the full distributional impact of treatments beyond just the mean.
method Uses kernel conditional mean embeddings and U-statistic regression to investigate the CoDiTE.
result Demonstrates the effectiveness of the proposed method through experiments.
Conditions for statistical structures on manifolds derived from solitons.
problem Characterizing statistical structures on manifolds from soliton equations.
method Analyzing gradient solitons on statistical manifolds to derive conditions for statistical structures.
result Established necessary and sufficient conditions for statistical structures under various soliton types.
New method uses sufficient statistics to infer causal relationships from observational data.
problem Inferring causal relationships from observational data with hidden variables.
method Information Bottleneck method applied to find functional sufficient statistics.
result New causal rules not obtainable from standard methods, validated on simulated and real data.
Huber regression assessed for robustness in statistical learning.
problem Understanding Huber regression in nonparametric statistical learning.
method Assessment from statistical learning perspective, focusing on risk consistency, adaptive tuning, and convergence rates.
result Huber regression can be asymptotically mean regression calibrated under (1+ε)-moment conditions, justifying its robustness. We extend nonparametric models to handle extrapolation, providing bounds for inference.
problem Challenges in nonparametric statistical inference when evaluating outside the conditioning variable's support.
method Introduced a class of extrapolation assumptions and a consistent estimation procedure to handle extrapolation.
result Validated extrapolation-aware conclusions through various applications and real-world data.
The speed with which a learning algorithm converges as it is presented with more data is a central problem in machine learning --- a fast rate of convergence means less data is needed for the same level of performance. The pursuit of fast rates in online and statistical learning has led to the discovery of many conditi…
A method uses neural networks to approximate sampling distributions of test statistics.
problem Accurate modeling of p-value functions or cdfs for correct confidence set coverage.
method Uses neural networks to model the cdf of test statistics, approximating sampling distributions.
result Neural network approximations of sampling distributions are effective and simple.
MixCIT tests conditional independence for mixed data types efficiently and reliably.
problem Testing conditional independence for mixed data types, especially when at least one is continuous.
method Graph-based test statistic comparing kernel similarities, debiased local-polynomial approach for continuous variables.
result Unified, efficient, and statistically guaranteed solution across heterogeneous data types.
The paper proves universality in optimization problems with i.i.d. random vectors.
problem Optimization problems with i.i.d. random vectors and their projections.
method Proves universality of empirical risk minimization under specific conditions.
result The minimum value of the optimization problem is universal and depends only on the mean and covariance of the random vectors.
A new knockoff statistic using conditional prediction function improves variable selection in complex models.
problem Controlling false discovery rate in complex models with nonlinear relationships.
method Introducing a knockoff statistic based on the conditional prediction function for use with machine learning models.
result The CPF statistics provide superior power in detecting prognostic variables over existing knockoff statistics.
The book chapter discusses tail risk analysis for financial data using extreme value statistics.
problem Serial dependence in financial time series complicates tail risk assessment.
method The approach involves unconditional and conditional quantile forecasting.
result Serial dependence impacts multivariate tail dependence.
Quantum algorithms improve high-frequency trading efficiency.
problem Reducing calculation time in high-frequency statistical arbitrage trading.
method Variable time condition number estimation and quantum linear regression.
result Quantum advantage in trading algorithm complexity reduction.
Study on DiTs' rates of approximation and estimation under various data assumptions.
problem Investigating statistical rates of conditional diffusion transformers.
method Discretization and Taylor expansion of conditional diffusion score function under Hölder smooth data assumption.
result Establishes statistical limits for conditional and unconditional DiTs, offering practical guidance.
The goal of feature selection is to identify important features that are relevant to explain an outcome variable. Most of the work in this domain has focused on identifying globally relevant features, which are features that are related to the outcome using evidence across the entire dataset. We study a more fine-grain…
In this note we prove certain necessary and sufficient conditions for the existence of an embedding of statistical manifolds. In particular, we prove that any compact smooth (C1 resp.) statistical manifold can be embedded into the space of probability measures on a finite set. As a result, we get an answer to the La…
A new test for conditional independence in discretized data.
problem Testing conditional independence when only discretized observations are available.
method Proposes a conditional independence test designed for discretized observations, using bridge equations to recover latent variables' information.
result Demonstrates the effectiveness of the proposed test through theoretical and empirical validation.
We investigate conditions under which test statistics exist that can reliably detect examples, which have been adversarially manipulated in a white-box attack. These statistics can be easily computed and calibrated by randomly corrupting inputs. They exploit certain anomalies that adversarial attacks introduce, in part…
Proposes a new method using GANs for testing conditional independence.
problem High-dimensional conditional independence testing in statistics and machine learning.
method Double GANs framework to learn conditional distributions, then construct a test statistic.
result The test statistic is doubly robust and has asymptotic power approaching one.
New method detects bearing faults using multivariate statistical process control.
problem Early detection of bearing faults in rotating machinery.
method Multivariate statistical process control charts applied to Fourier transform features of fixed-time batches.
result Effectiveness in detecting bearing faults across different conditions.
Private CI tests for continuous Z with privacy constraints.
problem Testing conditional independence under differential privacy constraints.
method Developed two private CI testing procedures based on generalized covariance and conditional randomization tests.
result First private CI tests with rigorous theoretical guarantees for continuous Z.
Robust CG methods avoid data corruption and solve structured statistical estimation problems.
problem Data corruption and heavy-tailed data in structured statistical estimation.
method Robustification of Conditional Gradient (CG) type methods using Huber's corruption model and robust mean gradient estimation.
result Robust CG methods converge linearly with correct sample complexity, even for high-dimensional problems.
Study on conditions for achieving optimal robustness in statistical estimators.
problem Achieving the optimal robustness of estimators in statistical models.
method Developed a Wasserstein analogue of the Cramer-Rao inequality and investigated conditions for achieving the Wasserstein-Cramer-Rao lower bound.
result Conditions for the existence of asymptotically efficient estimators in one-parameter models and location-scale families.
New statistical manifolds derived from identity map biharmonicity.
problem Deriving new statistical manifolds from identity map biharmonicity.
method Statistical biharmonicity of identity maps, semi-equiaffine condition, constant curvature.
result Determined statistical structures of new class of manifolds.
New method for mixed data FI controls type I error and achieves high power.
problem Statistical inadequacy of feature importance measures for mixed data.
method Combining CPI framework with sequential knockoffs for mixed data.
result Our method controls type I error and achieves high power for mixed data.
Paper develops a unified framework for measuring differences between conditional distributions.
problem Comparing conditional distributions in a unified and theoretically sound manner.
method Kernel embeddings and conditional maximum mean discrepancy (CMMD) framework.
result Established a coherent framework for measuring divergence between conditional distributions.
New method uses machine learning to improve statistical inference.
problem Performing inference on conditional functionals with scarce labeled data.
method Combines localization with prediction-based variance reduction.
result Valid and sharp confidence intervals for conditional functionals.
ACID neural network tests conditional independence efficiently.
problem Testing conditional independence in data.
method Amortized conditional independence testing using transformer-based neural networks.
result ACID achieves state-of-the-art performance and robust generalization.
New method tests CMI using deep neural networks for high-dimensional data.
problem Testing conditional mean independence in high-dimensional settings.
method Population CMI measure and bootstrap-based testing with deep generative neural networks.
result Strong empirical performance and versatility in various scenarios.
The φ-sectional curvature of statistical structures on almost contact metric manifolds is always non-positive.
problem Analyzing the φ-sectional curvature of statistical structures on almost contact metric manifolds.
method Investigating the φ-sectional curvature induced by a statistical structure and deriving sufficient conditions.
result The φ-sectional curvature is always non-positive.
New bounds for MCMC on discrete spaces without dimension dependence.
problem High-dimensional statistical convergence analysis of MCMC methods.
method Combining multicommodity flow and single-element drift conditions.
result Informed Metropolis-Hastings algorithms achieve relaxation times independent of dimension.
Cramming method evaluates learned policies from contextual bandits efficiently.
problem Evaluating final learned policies from contextual bandit algorithms.
method On-policy evaluation using a single pass of data, ensuring consistency and asymptotic normality.
result Cramming method reduces evaluation standard error by approximately 40% compared to off-policy methods.