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.
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…
Tests for equivariance in non-parametric regression models.
problem Detecting false assumptions of symmetry in regression models.
method Develops tests for G-equivariance independent of the model. result Confidence in using equivariant models when symmetry is unknown.
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.
Identity testing for reversible Markov chains without symmetry assumption.
problem Identity testing of reversible Markov chains.
method Using distance notion from Daskalakis et al. [2018a], testing without symmetry assumption.
result It is possible to perform identity testing under weaker assumption of reversibility.
Recently, the binary expansion testing framework was introduced to test the independence of two continuous random variables by utilizing symmetry statistics that are complete sufficient statistics for dependence. We develop a new test based on an ensemble approach that uses the sum of squared symmetry statistics and di…
Metric evaluates symmetry-breaking in datasets, revealing severe biases.
problem Symmetry-breaking in datasets can hinder the performance of symmetry-aware methods.
method Developed a metric to quantify symmetry-breaking using a two-sample classifier test.
result Symmetry-breaking can prevent optimal performance of invariant methods, even when labels are invariant.
A machine learning model with approximate rotational symmetry is tested and found stable.
problem The effects of broken symmetries in machine learning models.
method Testing a model with approximate rotational symmetry in various physical scenarios.
result The model remains stable even with noticeable symmetry artifacts, suggesting potential benefits.
Integrable symmetries of diffieties are studied, leading to local morphisms.
problem Understanding local integrable symmetries of diffieties.
method Integrable infinitesimal symmetries defined as a one-parameter pseudogroup of local diffiety morphisms. Reduction of computation to solving PDEs.
result Preliminary results and examples show integrable symmetries can be reduced to solving linear systems.
The paper studies symmetry reduction of control systems and its implications for feedback linearization.
problem Understanding symmetry reduction and its effects on feedback linearizability of control systems.
method Generalizing the notion of transversality of Lie group actions, analyzing the geometry of invariant distributions, and extending the S-G-S test.
result Classification of SFL quotients based on geometric properties of the control system and symmetry group.
Reduces identity testing of reversible Markov chains to simpler symmetric chain tests.
problem Testing identity of reversible Markov chains from a single trajectory.
method Using lumping-congruent Markov embeddings, the problem is simplified to testing symmetric chains over a larger state space.
result Achieves state-of-the-art sample complexity for identity testing.
Study on hidden symmetries in Dehn fillings of tetrahedral links.
problem Existence of infinite families of knot complements with hidden symmetries.
method Analysis of horoball packings and SnapPy algorithm.
result No infinite families of knot complements with hidden symmetries exist for given tetrahedral links and related manifolds.
Geometric GNNs improve graph discrimination through GWL.
problem Discriminating geometric graphs embedded in Euclidean space.
method Proposed a geometric version of the Weisfeiler-Leman test (GWL) for geometric graphs.
result Characterized the expressive power of geometric GNNs based on physical symmetries.
Improves reinforcement learning extrapolation in Gridworlds.
problem Generalizing to unseen states in reinforcement learning.
method Avoiding deterministic action choice, using ego-centric representation, incorporating symmetry, and adding an entropy term.
result Significant improvement in extrapolation performance in Gridworld environments.
The study shows symmetry improves machine learning generalization.
problem Improving machine learning generalization through symmetry.
method Using an averaging operator to prove equivariance reduces test risk.
result Equivariant predictors reduce test risk compared to non-equivariant ones.
Framework learns inter-electronic potential for molecular dynamics.
problem Predicting time-dependent Hartree-Fock dynamics from electron density.
method Developed three models using four-index tensors, preserving symmetries.
result Model with eight-fold symmetry performs best across metrics.
GE-autoencoder identifies spontaneous symmetry breaking in systems.
problem Locating phase boundaries and identifying spontaneously broken symmetries in systems.
method Group-equivariant autoencoder using group theory to constrain parameters and learn invariant order parameters.
result GE-autoencoder accurately determines spontaneous symmetry breaking and estimates critical temperatures more efficiently.
This work connects symmetries and conserved quantities in machine learning.
problem Improving machine learning models by learning conserved quantities.
method Using Noether's theorem, learn symmetries and conserved quantities directly from data.
result Correctly identifies conserved quantities and improves model performance.
We present an equivariant Liapunov stability criterion for dynamical systems with symmetry. This result yields a simple proof of the energy-momentum-Casimir stability analysis of relative equilibria of equivariant Hamiltonian systems.
Breaking symmetry in training data is key for generalization in feature learning kernels.
problem Grokking in algebraic tasks, where models perform well on training but fail on unseen data.
method Used Recursive Feature Machine (RFM) with AGOP to learn task-relevant features, breaking symmetry in training data.
result Generalization occurs only when symmetry in the training set is broken, and RFM generalizes by recovering underlying invariance group action.
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…
Symmetry in neural networks affects generalization, as shown by CLT and RG transformations.
problem Improving generalization in neural networks by incorporating physical symmetries.
method Evaluation of symmetry constraints and expressivity in MLPs and GNNs using the CLT as a test case.
result Overly complex or overconstrained models generalize poorly, revealing a competition between symmetry constraints and expressivity.
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.
Improves convergence speed in compressive sensing with a new probabilistic approach.
problem Efficiently solving the best subset selection problem in compressive sensing.
method Smooth probabilistic reformulation of ℓ0 regularized regression. result Empirically outperforms existing compressive sensing algorithms across various settings.
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.
Unified CI test for categorical and ordinal data maintains power in high dimensions.
problem Rapid degradation of statistical power in existing CI tests for high-dimensional conditioning variables.
method Unified CI test for categorical and ordinal data, maintaining reasonable calibration and power in high dimensions.
result Our test outperforms existing baselines in model testing and structure learning for dense directed graphical models.
This paper finds ReLU restores symmetry in SCL under class imbalances.
problem Symmetry break in SCL under class imbalances.
method Analytical proof and experiments with ReLU activation and batch selection.
result ReLU restores symmetry in SCL-learned representations without loss in test accuracy.
Study connects mirror symmetry invariants to K-stability for toric manifolds.
problem Relating invariants from mirror symmetry to K-stability for toric polarized manifolds.
method Analyzes expansions involving base loci of linear systems from Landau-Ginzburg potentials.
result Shows Z-stability naturally arises from mirror symmetry considerations.
New framework uses symmetry-based matrices for efficient, flexible NNs.
problem Designing neural networks with relaxed equivariance.
method Symmetry-based structured matrices, Group Matrices (GMs).
result GMs enable competitive performance with fewer parameters.
Group averaging boosts model accuracy without training cost.
problem Challenging training of equivariant models in physics.
method Group averaging at test time, improving accuracy.
result Improves model accuracy by up to 37% in continuous dynamics.
We revisit our construction of mirror symmetries for compactifications of Type II superstrings on twisted connected sum G2 manifolds. For a given G2 manifold, we discuss evidence for the existence of mirror symmetries of two kinds: one is an autoequivalence for a given Type II superstring on a mirror pair of $G_2…
LNNs learn Lagrangians without canonical coordinates, conserving energy and relativity.
problem Neural networks struggle to learn physical symmetries like conservation laws.
method Lagrangian Neural Networks (LNNs) parameterize arbitrary Lagrangians using neural networks.
result LNNs conserve energy and relativity in complex systems.
We establish an equivariant generalization of the Novikov inequalities which allow to estimate the topology of the set of critical points of a closed basic invariant 1-form by means of twisted equivariant cohomology of the manifold. We test and apply our inequalities in the case of a finite group. As an application we …
This paper considers control systems defined on Lie algebroids. After deriving basic controllability tests for general control systems, we specialize our discussion to the class of mechanical control systems on Lie algebroids. This class of systems includes mechanical systems subject to holonomic and nonholonomic const…
CantorNet tests geometric and topological complexity in neural networks.
problem Understanding self-similar patterns in neural networks.
method Inspired by Cantor set, CantorNet introduces novel complexity measures.
result CantorNet's decision boundaries are analytically known and can be arbitrarily ragged.
New method makes machine learning approximations unbiased and efficient.
problem Efficient sampling of complex probability distributions.
method Uses autoregressive neural networks with cluster updates and physical symmetries.
result Shows unbiased and low-variance approximations for phase transitions.
We introduce DQFIM to quantify and improve generalization of quantum machine learning models.
problem Understanding and improving generalization of quantum machine learning models.
method Data quantum Fisher information metric (DQFIM) to quantify circuit parameters and training data.
result Improves generalization by breaking symmetries of training data and using a low number of training states.
Computational materials screening studies require fast calculation of the properties of thousands of materials. The calculations are often performed with Density Functional Theory (DFT), but the necessary computer time sets limitations for the investigated material space. Therefore, the development of machine learning …
Optimal ability estimation in adaptive testing with binary responses.
problem Estimating a continuous ability parameter from sequential binary responses.
method Adaptive selection of questions to maximize Fisher information, updating estimate using method-of-moments, and deciding accuracy with a test statistic.
result Fisher-tracking strategy achieves optimal performance in fixed-confidence and fixed-budget regimes.
We propose a new class of semiparametric exponential family graphical models for the analysis of high dimensional mixed data. Different from the existing mixed graphical models, we allow the nodewise conditional distributions to be semiparametric generalized linear models with unspecified base measure functions. Thus, …
We develop a novel Gaussian process method for manifold data.
problem Challenges in Gaussian processes on manifold-based predictors, especially in high dimensions.
method Intrinsic approach for constructing Gaussian processes on general manifolds, using the exponential map for heat kernel estimation.
result Remarkable efficiency gains and applicability to high-dimensional manifolds.
Study properties of holomorphic p-contact manifolds, including non-Kähler hyperbolicity and deformations.
problem Characterize the geometric and algebraic properties of holomorphic p-contact manifolds. method Explores non-Kähler hyperbolicity, differential calculus, and p-contact deformations, proving unobstructedness theorems. result Proves a Bogomolov-Tian-Todorov-type unobstructedness theorem for p-contact deformations up to order two. The paper develops an asymptotic theory of self-supervised pre-training.
problem Sharpness of current rates in self-supervised pre-training and their accuracy.
method Two-stage M-estimation and tools from Riemannian geometry.
result Characterization of the limiting distribution of the downstream test risk.
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.
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.
Humans take advantage of real world symmetries for various tasks, yet capturing their superb symmetry perception mechanism with a computational model remains elusive. Motivated by a new study demonstrating the extremely high inter-person accuracy of human perceived symmetries in the wild, we have constructed the first …
Classifies symmetries of non-flat 3-webs around a point.
problem Understanding symmetries of non-flat 3-webs.
method Classification and construction methods for symmetries.
result Classification of symmetries for non-flat 3-webs.