English
Related papers

Related papers: On some deterministic dictionaries supporting spar…

200 papers

We study Hilbert spaces $H$ interpreted, in an appropriate sense, in a first-order theory. Under a new finiteness hypothesis that we call {\em scatteredness} we prove that $H$ is a direct sum of {\em asymptotically free} components, where…

Logic · Mathematics 2022-09-13 Alexis Chevalier , Ehud Hrushovski

Recent work in signal processing and statistics have focused on defining new regularization functions, which not only induce sparsity of the solution, but also take into account the structure of the problem. We present in this paper a class…

Machine Learning · Computer Science 2011-10-21 Julien Mairal , Rodolphe Jenatton , Guillaume Obozinski , Francis Bach

In this paper two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits sparsity and can deal well with closely located clusters that may…

Computer Vision and Pattern Recognition · Computer Science 2015-10-16 Spyridoula D. Xenaki , Konstantinos D. Koutroumbas , Athanasios A. Rontogiannis

We present theoretical guarantees for an alternating minimization algorithm for the dictionary learning/sparse coding problem. The dictionary learning problem is to factorize vector samples $y^{1},y^{2},\ldots, y^{n}$ into an appropriate…

Machine Learning · Statistics 2019-08-01 Niladri S. Chatterji , Peter L. Bartlett

A dynamic dictionary is a data structure that maintains sets of cardinality at most $n$ from a given universe and supports insertions, deletions, and membership queries. A filter approximates membership queries with a one-sided error that…

Data Structures and Algorithms · Computer Science 2020-06-23 Ioana Oriana Bercea , Guy Even

The efficient sparse coding and reconstruction of signal vectors via linear observations has received a tremendous amount of attention over the last decade. In this context, the automated learning of a suitable basis or overcomplete…

Information Theory · Computer Science 2015-06-19 Andreas M. Tillmann

Within the framework of the recently proposed formalism using non-hermitean Hamiltonians constrained merely by their PT invariance we describe a new exactly solvable family of the harmonic-oscillator-like potentials with non-equidistant…

Quantum Physics · Physics 2009-10-31 Miloslav Znojil

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

Commutative Algebra · Mathematics 2013-02-05 Emilie Dufresne , Jonathan Elmer , Müfit Sezer

Any limiting point process for the time normalized exceedances of high levels by a stationary sequence is necessarily compound Poisson under appropriate long range dependence conditions. Typically exceedances appear in clusters. The…

Applications · Statistics 2009-03-03 Christian Y. Robert

We introduce a novel way to incorporate prior information into (semi-) supervised non-negative matrix factorization, which we call differentiable dictionary search. It enables general, highly flexible and principled modelling of mixtures…

Audio and Speech Processing · Electrical Eng. & Systems 2022-11-29 Lukáš Samuel Marták , Rainer Kelz , Gerhard Widmer

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Combinatorics · Mathematics 2025-09-17 Nataša Jonoska , Francisco Martinez-Figueroa , Masahico Saito

Sparse representations using data dictionaries provide an efficient model particularly for signals that do not enjoy alternate analytic sparsifying transformations. However, solving inverse problems with sparsifying dictionaries can be…

Computer Vision and Pattern Recognition · Computer Science 2021-01-01 Vishwanath Saragadam , Xin Li , Aswin Sankaranarayanan

In this article, the concept of copulas is generalised to infinite dimensional Hilbert spaces. We show one direction of Sklar's theorem and explain that the other direction fails in infinite dimensional Hilbert spaces. We derive a necessary…

Probability · Mathematics 2015-09-24 Erika Hausenblas , Markus Riedle

An algebraic classification is given for spaces of holomorphic vector-valued modular forms of arbitrary real weight and multiplier system, associated to irreducible, T-unitarizable representations of the full modular group, of dimension…

Number Theory · Mathematics 2012-01-27 Christopher Marks

Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…

Formal Languages and Automata Theory · Computer Science 2026-05-28 Richard Mandel , Corto Mascle , Georg Zetzsche

Extended Alexander groups are used to define an invariant for open virtual strings. Examples of non-commuting open strings and a ribbon-concordance obstruction are given. An example is given of a slice virtual open string that is not…

Geometric Topology · Mathematics 2007-05-23 Daniel S. Silver , Susan G. Williams

Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our…

Quantum Physics · Physics 2025-12-22 K. Andrzejewski , K. Bolonek-Lasoń , P. Kosiński

We characterize those finite groups for which the bounded derived category of finite dimensional representations over an algebraically closed field of characteristic $p$ has distributive lattice of thick subcategories: they are precisely…

Representation Theory · Mathematics 2026-05-01 Sira Gratz , Greg Stevenson

Let ${\mathbb M}$ be an arbitrary o-minimal structure. Let $G$ be a definably compact definably connected abelian definable group of dimension $n$. Here we compute the new the intrinsic o-minimal fundamental group of $G;$ for each $k>0$,…

We introduce a suitable notion of integral operators (comprising the fractional Laplacian as a particular case) acting on functions with minimal requirements at infinity. For these functions, the classical definition would lead to divergent…

Analysis of PDEs · Mathematics 2022-02-09 Serena Dipierro , Aleksandr Dzhugan , Enrico Valdinoci