English
Related papers

Related papers: Narrow Resonances Revisited -- Simplifying Multidi…

200 papers

We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel is equivalent to a rank constrained rank minimization problem (RCRM), when the signal spaces…

Information Theory · Computer Science 2015-03-17 Dimitris S. Papailiopoulos , Alexandros G. Dimakis

Regularization plays a pivotal role when facing the challenge of solving ill-posed inverse problems, where the number of observations is smaller than the ambient dimension of the object to be estimated. A line of recent work has studied…

Optimization and Control · Mathematics 2014-07-03 Samuel Vaiter , Mohammad Golbabaee , Jalal M. Fadili , Gabriel Peyré

Neural networks achieve state-of-the-art performance in image classification, speech recognition, scientific analysis and many more application areas. Due to the high computational complexity and memory footprint of neural networks, various…

Hardware Architecture · Computer Science 2025-04-21 Benjamin Ramhorst , Vladimir Loncar , George A. Constantinides

Spectral dimensionality reduction algorithms are widely used in numerous domains, including for recognition, segmentation, tracking and visualization. However, despite their popularity, these algorithms suffer from a major limitation known…

Machine Learning · Computer Science 2018-01-03 Yochai Blau , Tomer Michaeli

The problem of recovering a low $n$-rank tensor is an extension of sparse recovery problem from the low dimensional space (matrix space) to the high dimensional space (tensor space) and has many applications in computer vision and graphics…

Optimization and Control · Mathematics 2014-04-09 Min Zhang , Lei Yang , Zheng-Hai Huang

We demonstrate that almost all non-parametric dimensionality reduction methods can be expressed by a simple procedure: regularized loss minimization plus singular value truncation. By distinguishing the role of the loss and regularizer in…

Machine Learning · Computer Science 2012-07-03 Yaoliang Yu , James Neufeld , Ryan Kiros , Xinhua Zhang , Dale Schuurmans

The classic Resource Constrained Shortest Path (RCSP) problem aims to find a cost optimal path between a pair of nodes in a network such that the resources used in the path are within a given limit. Having been studied for over a decade,…

Artificial Intelligence · Computer Science 2025-04-17 Saman Ahmadi , Andrea Raith , Guido Tack , Mahdi Jalili

Reduced Rank Regression (RRR) is a widely used method for multi-response regression. However, RRR assumes a linear relationship between features and responses. While linear models are useful and often provide a good approximation, many…

Machine Learning · Statistics 2025-03-11 Leia Greenberg , Haim Avron

In the present work we introduce a unified framework that allows for the very first systematic construction of symmetric resonance-based integrators to approximate a wide class of nonlinear dispersive equations at low-regularity. The…

Numerical Analysis · Mathematics 2025-09-30 Yvonne Alama Bronsard , Yvain Bruned , Georg Maierhofer , Katharina Schratz

This paper develops a novel algorithm, termed \emph{SPARse Truncated Amplitude flow} (SPARTA), to reconstruct a sparse signal from a small number of magnitude-only measurements. It deals with what is also known as sparse phase retrieval…

Information Theory · Computer Science 2017-10-31 Gang Wang , Liang Zhang , Georgios B. Giannakis , Mehmet Akcakaya , Jie Chen

We address the numerical solution of minimal norm residuals of {\it nonlinear} equations in finite dimensions. We take inspiration from the problem of finding a sparse vector solution by using greedy algorithms based on iterative residual…

Numerical Analysis · Mathematics 2015-04-28 Juliane Sigl

This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries. We show that properly constrained nuclear-norm…

Information Theory · Computer Science 2010-01-05 Emmanuel J. Candes , Yaniv Plan

Multichannel audio mixer and limiter designs are conventionally decoupled for content reproduction over loudspeaker arrays due to high computational complexity and run-time costs. We propose a coupled mixer-limiter-envelope design…

Sound · Computer Science 2026-04-23 Yuancheng Luo , Dmitriy Yamkovoy , Guillermo Garcia

Efficient estimation of wideband spectrum is of great importance for applications such as cognitive radio. Recently, sub-Nyquist sampling schemes based on compressed sensing have been proposed to greatly reduce the sampling rate. However,…

Signal Processing · Electrical Eng. & Systems 2018-05-23 Haoyu Fu , Yuejie Chi

Clustering high-dimensional data often requires some form of dimensionality reduction, where clustered variables are separated from "noise-looking" variables. We cast this problem as finding a low-dimensional projection of the data which is…

Machine Learning · Statistics 2016-08-30 Nicolas Flammarion , Balamurugan Palaniappan , Francis Bach

The vast majority of Dimensionality Reduction (DR) techniques rely on second-order statistics to define their optimization objective. Even though this provides adequate results in most cases, it comes with several shortcomings. The methods…

Computer Vision and Pattern Recognition · Computer Science 2017-08-21 Nikolaos Passalis , Anastasios Tefas

We investigate the amount of primordial information that can be reconstructed from spectroscopic galaxy surveys, as well as what sets the noise in reconstruction at low wavenumbers, by studying a simplified universe in which galaxies are…

Cosmology and Nongalactic Astrophysics · Physics 2021-06-23 Matthew McQuinn

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited,…

Data Structures and Algorithms · Computer Science 2018-12-24 Haim Avron , Michael Kapralov , Cameron Musco , Christopher Musco , Ameya Velingker , Amir Zandieh

A major open problem in proof complexity is to demonstrate that random 3-CNFs with a linear number of clauses require super-polynomial size refutations in bounded-depth Frege systems. We take the first step towards addressing this question…

Computational Complexity · Computer Science 2024-09-04 Svyatoslav Gryaznov , Navid Talebanfard

While 3D reconstruction is a well-established and widely explored research topic, semantic 3D reconstruction has only recently witnessed an increasing share of attention from the Computer Vision community. Semantic annotations allow in fact…

Computer Vision and Pattern Recognition · Computer Science 2017-08-28 Andrea Romanoni , Marco Ciccone , Francesco Visin , Matteo Matteucci