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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920182026
48 results for probabilistic symmetry

New method for invariant neural networks using probabilistic symmetries.

problem Improving neural network performance in data-scarce, non-i.i.d., or unsupervised settings.
method Characterizing neural network structures invariant under compact group actions using probabilistic symmetry.
result Established a link between functional and probabilistic symmetry, yielding generative representations of invariant distributions.

Probabilistic models often have parameters that can be translated, scaled, permuted, or otherwise transformed without changing the model. These symmetries can lead to strong correlation and multimodality in the posterior distribution over the model's parameters, which can pose challenges both for performing inference a…

2013-12-19abs ↗pdf ↗

Bayesian Empirical Bayes extends EB to complex structures using probabilistic symmetry.

problem Improving simultaneous inference in complex settings like arrays and graphs.
method Generalized empirical Bayes approach based on probabilistic symmetry.
result BEB outperforms existing methods in denoising arrays and spatial data.

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\ell_0 regularized regression.
result Empirically outperforms existing compressive sensing algorithms across various settings.

Efficiently infers cluster assignments in probabilistic models.

problem Efficiently inferring cluster assignments in probabilistic models.
method Amortized approximate Bayesian inference mapping cluster representations into conditional probabilities.
result Parallelizable, yields iid samples with similar computational cost to Gibbs sampling.

We solve Bayesian PCA's rotational symmetry issue by rotation-invariant parameterization.

problem Bayesian PCA's rotational symmetry complicates inference and interpretation.
method Rotation-invariant Householder parameterization using random matrix theory.
result Efficient rotation-invariant probabilistic PCA implementation.

SymPE breaks symmetries in equivariant networks, improving performance across various tasks.

problem Equivariant networks cannot break symmetries, leading to poor performance in tasks with symmetrical inputs.
method Novel equivariant conditional distributions and randomized canonicalization.
result SymPE significantly improves performance of group-equivariant and graph neural networks.

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.

Efficiently samples and learns densities with symmetries using equivariant methods.

problem Efficiently sampling and learning densities with symmetries.
method Equivariant Stein Variational Gradient Descent (SVGD) and equivariant energy based models.
result Improves and scales up training of energy based models.

Extends DeTEcT framework for token economies with dynamic and probabilistic parameters.

problem Modeling wealth distribution in token economies with dynamic and probabilistic parameters.
method Introduces four parametrization techniques: dynamic vs static, probabilistic vs non-probabilistic.
result Derives existing wealth distribution models from DeTEcT framework with added restrictions.

Two approximate lifted variational methods for hybrid domains improve inference scalability and accuracy.

problem Efficient inference in hybrid probabilistic relational models with multi-modality and continuous evidence.
method Two approximate lifted variational approaches applicable to hybrid domains, exploiting model symmetries.
result The proposed variational methods are scalable and can leverage approximate model symmetries, outperforming existing message-passing approaches.

Learn class-invariant and symmetry-equivariant representations for multi-class data.

problem Deep neural networks learn opaque representations; we aim to make them more transparent.
method Probabilistic modelling with two separate latent variables: invariant and equivariant.
result Qualitative and quantitative performance competitive with other methods, with little tuning.

Paper develops a differentiable approach for 3D imaging models using Fourier slice theorem.

problem Uncertainty in 3D structure modeling and pose estimation in scientific imaging.
method Differentiable probabilistic models in Fourier space with backpropagation through projection.
result Validates approach on 3D protein reconstruction and extends to probabilistic models.

New approach resolves ambiguity in PPCA model's maximum likelihood estimation.

problem Ambiguity in maximum likelihood estimation of PPCA model due to rotational symmetry.
method Using quotient topological spaces, the approach resolves ambiguity and shows consistency of the maximum likelihood solution.
result Maximum likelihood solution is consistent in an appropriate quotient Euclidean space.

Extends probabilistic approach for Kahler-Einstein metrics on Fano manifolds.

problem Constructing Kahler-Einstein metrics on log Fano manifolds with non-discrete automorphism groups.
method Introduces Gibbs polystability and uses moment map constraint to break symmetry.
result Gibbs polystability conjectured to be equivalent to existence of Kahler-Einstein metric.

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.

Method improves deep learning models for datasets with mixed approximate symmetries.

problem Improving deep learning models for datasets with mixed approximate symmetries.
method Regularizer-based approach to build models for datasets with mixed approximate symmetries.
result Our method achieves better accuracy than prior approaches while discovering the approximate symmetry levels correctly.

Researchers construct a probabilistic model for a WZW theory on hyperbolic space and link it to Liouville theory.

problem Rigorous probabilistic construction of WZW models on curved spaces.
method Path integral approach on closed Riemann surfaces twisted by gauge fields.
result Correspondence between correlation functions of H3\mathbb{H}^3-WZW and Liouville CFT.

PENs learn summary statistics for ABC using invariant neural architectures.

problem Learning summary statistics for approximate Bayesian computation (ABC).
method Partially exchangeable networks (PENs) that are invariant to block-switch transformations.
result PENs provide more reliable posterior samples with less training data.

Symmetry in loss functions constrains model parameters, leading to specific learning outcomes.

problem Understanding and leveraging symmetries in neural networks to improve learning outcomes.
method Analyzing the impact of loss function symmetries on model parameters and learning behavior.
result Mirror-reflection symmetries in loss functions lead to constraints on model parameters, influencing learning outcomes.

Approximate symmetries of geodesic equations on 2-spheres are studied. These are the symmetries of the perturbed geodesic equations which represent approximate path of a particle rather than exact path. After giving the exact symmetries of the geodesic equations, two different approaches to study the approximate symmet…

2010-05-09abs ↗pdf ↗

New framework discovers non-affine continuous symmetries in neural networks.

problem Lack of efficient methods for detecting non-affine continuous symmetries in neural networks.
method Computational framework for discovering infinitesimal generators of multi-parameter group actions.
result Framework can discover non-affine continuous symmetries in neural networks.

Symmetry in neural networks reduces parameter count without sacrificing accuracy.

problem Improving parameter usage and efficiency in deep neural networks.
method Imposing symmetry constraints on neural network parameters, especially in convolutional and recurrent networks.
result Symmetry can have little or no negative effect on network accuracy, even in deep overparameterized networks.

This paper introduces a new approach to finding knots and links with hidden symmetries using "hidden extensions", a class of hidden symmetries defined here. We exhibit a family of tangle complements in the ball whose boundaries have symmetries with hidden extensions, then we further extend these to hidden symmetries of…

2015-01-04abs ↗pdf ↗

Symmetry of neural network densities can be determined from correlation functions.

problem Determining symmetries of neural network densities without knowing the density itself.
method Symmetry-via-duality approach using invariance properties of correlation functions.
result Symmetries of neural network densities can be determined via dual computations of correlation functions.

Clarifies relation between Pfaffian fibrations and relative algebroids.

problem Understanding geometric structures and symmetries in PDEs.
method Introduces and analyzes Pfaffian fibrations and relative algebroids, clarifying their relationship.
result Every Pfaffian fibration induces a relative algebroid, and their prolongations and local solutions coincide.

This work relaxes GNN symmetries to approximate automorphisms, improving model performance.

problem Improving graph neural network performance on asymmetric graphs.
method Formalizing approximate symmetries via graph coarsening, introducing a bias-variance formula.
result Best generalization performance achieved by choosing a larger symmetry group than automorphisms but smaller than permutations.

Noether's theorem clarifies how symmetries in neural networks influence learning.

problem Understanding how symmetries in neural networks affect learning.
method Systematic study of symmetry interactions with learning algorithms using Noether's theorem.
result Symmetries impose restrictions on the optimization path, leading to conserved quantities.

This paper aims to incorporate passive symmetries in machine learning for better generalization.

problem Machine learning's reliance on arbitrary choices leads to passive symmetries that can limit generalization.
method Translation among physics, mathematics, and machine learning to understand and implement passive symmetries.
result Respecting passive symmetries can improve machine learning's ability to generalize.

Study of symmetries in 2D Yang-Mills theory, including orbifolds and higher forms.

problem Understanding symmetries and anomalies in 2D Yang-Mills theory.
method Combining continuum methods, topological defects, and higher gauge theory.
result Unified description of higher and lower form gauge fields, identifying spontaneous symmetry breaking.