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…
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,742 papers · 148 categories
Trend · papers per month
48 results for “symmetry statistics”
Symmetry helps VI recover certain statistics.
problem Understanding how symmetry in variational inference affects the recovery of statistics.
method Developed a general theory of symmetry-induced statistic recovery in variational inference.
result Symmetry can force the recovery of certain statistics in VI, even under model misspecification.
Assessing symmetry of financial returns seriesphysics.data-an
Testing symmetry of a probability distribution is a common question arising from applications in several fields. Particularly, in the study of observables used in the analysis of stock market index variations, the question of symmetry has not been fully investigated by means of statistical procedures. In this work a di…
Develops tests for conditional symmetry under group actions.
problem Testing conditional symmetry in distributions under group actions.
method Nonparametric randomization tests with kernel methods and asymptotic consistency.
result Tests achieve finite-sample Type I error control and power.
Develops non-parametric tests for group symmetry in data.
problem Lack of statistical tests for group symmetry in data.
method Formulates and implements non-parametric tests for distributional symmetry under specified groups.
result Develops tests for conditional invariance/equivariance and applies them to real-world data.
BERET improves binary expansion test for multivariate independence.
problem Testing independence of random vectors in arbitrary dimensions.
method Ensemble approach using sum of squared symmetry statistics and distance correlation.
result Improves power while preserving interpretability.
This work provides statistical guarantees for GANs that are invariant to certain group symmetries.
problem Learning group-invariant distributions efficiently.
method Study of group-invariant GANs and their performance guarantees.
result Group-invariant GANs require fewer samples and have a reduced discriminator approximation error.
We present a symmetry analysis of the distribution of variations of different financial indices, by means of a statistical procedure developed by the authors based on a symmetry statistic by Einmahl and Mckeague. We applied this statistical methodology to financial uninterrupted daily trends returns and to other derive…
BET on Independencemath.ST
We study the problem of nonparametric dependence detection. Many existing methods may suffer severe power loss due to non-uniform consistency, which we illustrate with a paradox. To avoid such power loss, we approach the nonparametric test of independence through the new framework of binary expansion statistics (BEStat…
BEAUTY Powered BEASTstat.ME
A new test method improves goodness-of-fit tests for copulas.
problem Developing robust tests for copula goodness-of-fit.
method Binary Expansion Approximation of UniformiTY (BEAUTY) and Binary Expansion Adaptive Symmetry Test (BEAST).
result The BEAST method improves empirical power against various alternatives.
Equivariant flows generate symmetric distributions for complex systems.
problem Generating symmetric distributions for complex systems with exact likelihood.
method Equivariant normalizing flows that preserve symmetries.
result Equivariant flows generate symmetric distributions that are invariant to symmetries in physical systems.
Data augmentation can achieve the same statistical benefits as full augmentation up to an approximation error.
problem Data augmentation in learning problems
method Using Fourier analysis and representation theory of finite groups
result Partial data augmentation achieves the same minimax rates as full augmentation
Generative diffusion models exhibit phase transitions in statistical mechanics, impacting their performance.
problem Understanding the performance and capabilities of generative diffusion models.
method Reformulating generative diffusion models using statistical mechanics, focusing on phase transitions and symmetry breaking.
result Generative diffusion models undergo second-order phase transitions with mean-field universality, critical instability, and mean-field critical exponents.
The paper tackles learning symmetries in data without expert knowledge.
problem Learning symmetries in data from raw data without prior knowledge.
method Develops methods to select eigenvectors for orthogonal symmetries and compares their effectiveness.
result The problem of learning symmetries is as hard as the graph automorphism problem in the worst case, but can be simplified with certain restrictions.
Bayesian framework detects symmetries in chaotic dynamical systems.
problem Detecting symmetries in chaotic attractors for insights into dynamical system structure.
method Bayesian framework using Gibbs posterior constructed from Wasserstein distances.
result Bayesian framework accurately recovers symmetries under high noise and small sample sizes.
Invariant kernels reduce rank and improve generalization across dimensions.
problem Symmetry in high-dimensional data impacts kernel matrix rank and learning algorithms.
method Compute invariant polynomial kernel ranks under various groups acting on data.
result Symmetry decreases kernel rank, making it independent of data dimension.
Proposes learning invariances in neural networks using a weight-space approach.
problem Learning invariances from data in neural networks remains an open problem.
method Minimizes a lower bound on the marginal likelihood in weight space.
result Results in higher performing models with naturally learned invariances.
Statistical manifolds with constant curvature are projectively flat and symmetric.
problem Characterizing statistical manifolds with constant curvature.
method Analyzing the curvature and projective flatness properties of statistical manifolds.
result Statistical manifolds with constant curvature are projectively flat and symmetric.
Gradient descent struggles to learn equivariant neural networks, even with symmetries.
problem Learning equivariant neural networks via gradient descent is hard.
method Lower bounds for various equivariant neural network classes.
result Gradient descent struggles to learn equivariant neural networks, even with symmetries.
Study disproves conjecture about low-degree polynomials in hypothesis testing.
problem Conjecture about limitations of polynomial-time algorithms in hypothesis testing.
method Used counterexamples to refute the conjecture and modified the conjecture to rule out the counterexample.
result Disproved conjecture about limitations of low-degree polynomials in hypothesis testing.
New algebraic geometry and statistical manifold connections proven.
problem Understanding the structure of statistical manifolds and their algebraic properties.
method Developed relations between algebraic geometry, information theory, and Topological Field Theory.
result Statistical pre-Frobenius manifolds form algebraic varieties and have hexagonal, isoclinic webs.
Study binary perceptrons' capacity using random duality theory.
problem Characterize the capacity of binary perceptrons with general thresholds.
method Utilized fully lifted random duality theory (fl RDT) to characterize the capacity.
result Characterizations match replica symmetry breaking predictions and uncover the capacity for zero-threshold scenario.
Statistical Einstein manifolds of exponential families with group-invariant potential functionsmath-ph
This paper mainly contributes to a classification of statistical Einstein manifolds, namely statistical manifolds at the same time are Einstein manifolds. A statistical manifold is a Riemannian manifold, each of whose points is a probability distribution. With the Fisher information metric as a Riemannian metric, infor…
In this letter, we apply the artificial neural network in a supervised manner to map out the quantum phase diagram of disordered topological superconductor in class DIII. Given the disorder that keeps the discrete symmetries of the ensemble as a whole, translational symmetry which is broken in the quasiparticle distrib…
Unsupervised and Supervised learning by Dense Associative Memory under replica symmetry breakingcond-mat.dis-nn
Dense Associative Memories outperform classical networks in robustness and signal processing.
problem Improving neural network performance in adversarial attacks and weak signal processing.
method Relaxing replica symmetry in statistical mechanics of spin glasses to analyze unsupervised and supervised learning.
result Explicit analytical investigation of phase diagrams and storage capacities for Dense Associative Memories.
Researchers develop a new method for analyzing shape changes in medical data.
problem Analyzing continuous transformations like shape changes in medical datasets.
method Geodesic regression using an affine connection setting on Lie groups.
result Efficient fixed point algorithm for computing geodesic relationships.
Analyzes the Hessian of ReLU networks, proving skewed eigenvalue distribution.
problem Characterizing the Hessian at spurious minima in shallow ReLU models.
method Symmetry breaking and representation theory techniques.
result Proves skewed eigenvalue distribution of Hessian at spurious minima.
Data augmented bootstrap: Unifying confidence interval construction by approximate invariancestat.ME
Data augmented bootstrap unifies various confidence interval construction methods.
problem Constructing confidence intervals from data transformations.
method Data augmented bootstrap (DAB) framework.
result Establishes theoretical coverage results for DAB methods.
Symmetry alteration of ensemble return distribution in crash and rally days of financial marketscond-mat.stat-mech
We select the stocks traded in the New York Stock Exchange and we form a statistical ensemble of daily stock returns for each of the trading days of our database from the stock price time series. We study the ensemble return distribution for each trading day and we find that the symmetry properties of the ensem…
Equivalence between algorithmic instability and transition to replica symmetry breaking in perceptron learning systemscond-mat.dis-nn
Binary perceptron's instability linked to replica symmetry breaking.
problem Understanding the relationship between algorithmic instability and replica symmetry breaking in binary perceptron learning.
method Established the connection between algorithmic instability and replica symmetry breaking by comparing the instability condition around the fixed point to the instability for breaking the replica symmetric solution of the free energy function.
result The instability condition around the algorithmic fixed point is identical to the instability for breaking the replica symmetric saddle point solution of the free energy function.
We describe society as a nonequilibrium probabilistic system: N individuals occupy W resource states in it and produce entropy S over definite time periods. Resulting thermodynamics is however unusual because a second entropy, H, measures a typically social feature, inequality or diversity in the distribution of availa…
Characterizes connections on multivariate normal distributions.
problem Characterizing connections on statistical manifold of multivariate normal distributions.
method Analyzes statistical manifold of multivariate normal distributions.
result The Amari-Chentsov connection is characterized by conjugate symmetry.
SymmPI predicts unobserved values under group symmetries, improving over existing methods.
problem Quantifying uncertainty in predictions under group symmetries.
method Distributional equivariant transformations to preserve symmetries.
result SymmPI provides valid coverage and performs favorably in simulations and empirical data.
Group-invariant neural networks improve approximation accuracy for symmetric functions.
problem Improving approximation accuracy for symmetric functions using neural networks.
method Investigates the generalization error of group-invariant neural networks within the Barron framework.
result Group invariance introduces a factor δ that can significantly improve approximation accuracy when it is small.
We reformulate wealth taxation using Fokker-Planck equations to ensure tax neutrality.
problem Ensuring tax neutrality in wealth taxation frameworks.
method Reformulating the neutral wealth tax framework using stochastic dynamics and statistical physics, specifically Fokker-Planck equations.
result The framework clarifies when wealth taxation is a benign rescaling of dynamics and when it introduces new physics.
Rademacher complexity and spin glasses: A link between the replica and statistical theories of learningcond-mat.dis-nn
Statistical learning theory connects to spin glass models via Rademacher complexity and replica theory.
problem Bounding generalization gap in statistical learning theory.
method Linking Rademacher complexity in statistical learning to synthetic models in statistical physics.
result Rademacher complexity is closely related to ground state energy in spin glass models.
Quantum 4d Yang-Mills Theory and Time-Reversal Symmetric 5d Higher-Gauge Topological Field Theoryhep-th
We explore 4d Yang-Mills gauge theories (YM) living as boundary conditions of 5d gapped short/long-range entangled (SRE/LRE) topological states. Specifically, we explore 4d time-reversal symmetric pure YM of an SU(2) gauge group with a second-Chern-class topological term at (SU(2) YM), by turning on backg…
We present a novel family of deep neural architectures, named partially exchangeable networks (PENs) that leverage probabilistic symmetries. By design, PENs are invariant to block-switch transformations, which characterize the partial exchangeability properties of conditionally Markovian processes. Moreover, we show th…
Label switching is a phenomenon arising in mixture model posterior inference that prevents one from meaningfully assessing posterior statistics using standard Monte Carlo procedures. This issue arises due to invariance of the posterior under actions of a group; for example, permuting the ordering of mixture components …
Sparse Representations, Inference and Learningcond-mat.stat-mech
Statistical physics helps solve complex machine learning problems.
problem Large dimensional inference problems in machine learning.
method Replica symmetric level analysis and cavity methods.
result General framework for solving various problems with weak long-range interactions.
New method uses spherical harmonics to simplify learning single-index models.
problem Learning single-index models with unknown one-dimensional projections.
method Proposes using spherical harmonics instead of Hermite polynomials to capture rotational symmetry.
result Characterizes the complexity of learning single-index models under arbitrary spherically symmetric input distributions.
Method identifies causal drivers from background features.
problem Distinguishing causal influence from hidden confounding.
method Stability of regression coefficients measured by statistic V.
result V converges to zero if and only if no causal drivers exist.
Anomalies in (2+1)D fermionic topological phases and (3+1)D path integral state sums for fermionic SPTscond-mat.str-el
Constructs a path integral for fermionic SPTs, solving anomalies in 2+1D topological orders.
problem Anomalies in (2+1)D fermionic topological phases and their computation.
method Combining (2+1)D fermionic topological order with symmetry fractionalization data to construct a (3+1)D path integral.
result Reproduces the anomaly indicator for time-reversal symmetric topological superconductors.
Square-tiled surfaces are a class of translation surfaces that are of particular interest in geometry and dynamics because, as covers of the square torus, they share some of its simplicity and structure. In this paper, we study counting problems that result from focusing on properties of the square torus one by one. Af…
New neural networks respect symmetries in symmetric tensors, improving efficiency and generalization.
problem Learning from symmetric tensors efficiently and respecting their inherent symmetries.
method Developed two characterizations of linear permutation equivariant functions between symmetric power spaces of R^n.
result These functions are highly data efficient compared to standard MLPs and generalize well to different sizes of symmetric tensors.
The paper analyzes symmetries of Vaidya-Bonner geodesics.
problem Investigating invariance properties of Vaidya-Bonner geodesics.
method Classification of Lie point symmetries and Noether symmetries, determination of optimal system of subalgebras.
result Determination of optimal system of subalgebras for Vaidya-Bonner geodesics.
Paper presents a method to summarize HMC samples for neural networks, providing meaningful uncertainty estimates.
problem Lack of interpretable summary statistics for HMC samples in neural networks due to permutation symmetry.
method Introducing a transpositions metric to quantify permutations and using rebasin method to summarize HMC samples.
result Compact representation of HMC samples provides meaningful uncertainty estimates for each weight in a neural network.
New method detects symmetries beyond affine transformations.
problem Current methods limit symmetry detection to affine transformations.
method Framework for discovering continuous symmetry beyond affine transformations.
result Method is competitive for large sample sizes and superior for small sample sizes.