paper-with-me

홈 › Papers

Learning optimal smooth invariant subspaces for data approximation

2023-11-21 · Davide Barbieri, Eugenio Hernández, Carlos Cabrelli, Ursula Molter

In this article, we consider the problem of approximating a finite set of data (usually huge in applications) by invariant subspaces generated through a small set of smooth functions. The invariance is either by translations under a full-rank lattice or through the action of crystallographic groups. Smoothness is ensured by stipulating that the generators belong to a Paley-Wiener space, that is selected in an optimal way based on the characteristics of the given data. To complete our investigation, we analyze the fundamental role played by the lattice in the process of approximation.

📄 PDF Abstract BibTeX arXiv:2311.12544

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Emergent Low-Rank Training Dynamics in MLPs with Smooth Activations

2026-02-05 · Alec S. Xu, Can Yaras, Matthew Asato, Qing Qu 외 arxiv

Recent empirical evidence has demonstrated that the training dynamics of large-scale deep neural networks occur within low-dimensional subspaces. While this has inspired new research into low-rank training, compression, …

Near-Optimal and Tractable Estimation under Shift-Invariance

2024-11-05 · Dmitrii M. Ostrovskii

How hard is it to estimate a discrete-time signal $(x_{1}, ..., x_{n}) \in \mathbb{C}^n$ satisfying an unknown linear recurrence relation of order $s$ and observed in i.i.d. complex Gaussian noise? The class of all such …

All

Learning Invariances with Generalised Input-Convex Neural Networks

2022-04-14 · Vitali Nesterov, Fabricio Arend Torres, Monika Nagy-Huber, Maxim Samarin 외

Considering smooth mappings from input vectors to continuous targets, our goal is to characterise subspaces of the input domain, which are invariant under such mappings. Thus, we want to characterise manifolds implicitly…

Computational chemistry

Invariant and Dual Invariant Subspaces of $k$-valued Networks

2022-09-01 · Daizhan Cheng, HongSheng Qi, Xiao Zhang, Zhengping Ji

Consider a $k$-valued network. Two kinds of (control) invariant subspaces, called state and dual invariant subspaces, are proposed, which are subspaces of state space and dual space respectively. Algorithms are presented…

Learning Koopman Eigenfunctions and Invariant Subspaces from Data: Symmetric Subspace Decomposition

2020-02-22

This paper develops data-driven methods to identify eigenfunctions of the Koopman operator associated to a dynamical system and subspaces that are invariant under the operator. We build on Extended Dynamic Mode Decomposi…