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,695 papers · 148 categories

Trend · papers per month

2845698531,137 · Jun 202019922001200920172026
48 results for data symmetries

New method discovers symmetries in differential equations from data.

problem Directly identifying Lie symmetries from scattered data without explicit equations.
method Numerical scheme using manifold learning and linear system construction.
result Accuracy and robustness demonstrated in various differential equations.

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.

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.

We survey the role of symmetry in diffeomorphic registration of landmarks, curves, surfaces, images and higher-order data. The infinite dimensional problem of finding correspondences between objects can for a range of concrete data types be reduced resulting in compact representations of shape and spatial structure. Th…

2014-12-23abs ↗pdf ↗

The paper investigates how symmetry in models affects their performance and generalization.

problem Understanding how symmetry in models impacts their performance and generalization.
method Formal unified investigation of intuitions about symmetry in models and data.
result Quantitative bounds and comparisons between model and data equivariance lead to optimal model performance.

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.

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.

Permutation of any two hidden units yields invariant properties in typical deep generative neural networks. This permutation symmetry plays an important role in understanding the computation performance of a broad class of neural networks with two or more hidden units. However, a theoretical study of the permutation sy…

2019-04-30abs ↗pdf ↗

Automatically learns flexible symmetry constraints in neural networks using gradients.

problem Fixed hard constraints on neural network functions that cannot be adapted.
method Improves parameterisations of soft equivariance and optimizes marginal likelihood using differentiable Laplace approximations.
result Achieves equivalent or improved performance on image classification tasks compared to baselines with hard-coded symmetry.

Develops geometric causal models for causal inference from dependent data.

problem Causal inference from structured, dependent data (e.g., spatial, network, molecular).
method Geometric causal models (GCMs) exploiting symmetries of data generating process, combining group theory, ergodic theory, and Bayesian inference.
result Establishes identification and estimation of causal effects from dependent data.

Develops SymGCP for tensor decompositions with general symmetry.

problem Handling symmetry in tensor decompositions for better model accuracy.
method Introduces SymGCP, a generalized CP decomposition that accounts for any subset of tensor modes' symmetry.
result SymGCP enables efficient and scalable tensor decomposition with improved model robustness and accuracy.

This work extends PAC-Bayesian learning guarantees to non-compact symmetries and non-invariant data.

problem Lack of theoretical guarantees explaining the benefits of symmetries in machine learning models.
method Adapting and tightening PAC-Bayes bounds for non-compact symmetries and non-invariant data distributions.
result Theoretical evidence that symmetric models are preferable for symmetric data, beyond compact groups and invariant distributions.

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.

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.

Leveraging the intrinsic symmetries in data for clear and efficient analysis is an important theme in signal processing and other data-driven sciences. A basic example of this is the ubiquity of the discrete Fourier transform which arises from translational symmetry (i.e. time-delay/phase-shift). Particularly important…

2018-12-08abs ↗pdf ↗

Unconstrained models learn physical symmetries effectively with simple data augmentation.

problem Ensuring physical symmetries in machine learning models.
method Rigorous metrics to measure symmetry content, data augmentation strategy, architectural analysis.
result Unconstrained models can learn approximate equivariant behavior with simple data augmentation.

In this paper we explore methods to exploit symmetries for ensuring sample efficiency in reinforcement learning (RL), this problem deserves ever increasing attention with the recent advances in the use of deep networks for complex RL tasks which require large amount of training data. We introduce a novel method to dete…

2017-06-09abs ↗pdf ↗

Symmetry in inverse problems leads to multiple solutions, but breaking symmetry helps deep learning.

problem Symmetry in physical systems causes multiple solutions in inverse problems, hindering deep learning.
method Careful symmetry breaking on training data helps solve inverse problems and improve deep learning performance.
result Symmetry breaking on training data significantly improves deep learning performance in inverse problems.

Symmetry, a central concept in understanding the laws of nature, has been used for centuries in physics, mathematics, and chemistry, to help make mathematical models tractable. Yet, despite its power, symmetry has not been used extensively in machine learning, until rather recently. In this article we show a general wa…

2018-11-16abs ↗pdf ↗

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.

We introduce the concept of spontaneous symmetry breaking to arbitrage modeling. In the model, the arbitrage strategy is considered as being in the symmetry breaking phase and the phase transition between arbitrage mode and no-arbitrage mode is triggered by a control parameter. We estimate the control parameter for mom…

2011-07-26abs ↗pdf ↗

Paper relaxes symmetry conditions for universal feature selection in noisy data.

problem Feature selection in noisy data with weak symmetry.
method Developed a universal feature selection framework using singular value decomposition of canonical dependence matrix.
result Selected features achieve asymptotically optimal error exponents up to a residual term.

Paper discovers governing equations from data using differential invariants.

problem Discovering partial differential equations from data is challenging.
method The paper proposes a pipeline based on differential invariants to reduce the search space and adhere to symmetry.
result DI-SINDy method outperforms other symmetry-informed methods in PDE discovery.

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.

Deep neural networks favor symmetric structures, enabling multilevel symmetries.

problem Understanding and optimizing deep neural networks.
method Formulating DNN training as convex Lasso problems with geometric algebra.
result Deep networks inherently favor symmetric structures, enabling multilevel symmetries.

C-SymmPI provides near-conditional coverage for structured data with group symmetries.

problem Establishing near-conditional coverage guarantees for structured data with group symmetries.
method Developed a framework C-SymmPI that achieves near-conditional coverage under general data structures with group symmetries.
result Near-conditional coverage guarantees for structured data with group symmetries.

Constructs initial data for Einstein equations and estimates Bartnik mass outside time-symmetry.

problem Estimating Bartnik mass outside time-symmetry.
method Constructs initial data for Einstein equations and connects Bartnik data to time-symmetric data.
result Obtains estimates for the Bartnik mass outside of time-symmetry.