← Search

Raviv Raich

21 accepted papers

2025

Maximum Likelihood Estimation of Stable ARX Models using Randomized Coordinate Descent

ICASSP 2025accepted

Autoregressive models play an important role in a variety of applications including finance, engineering, sciences, and agriculture. While for some models (e.g., physics-based models) parameters are known, in other domains the parameters may not be available. This paper deals with the estimation of…

Cited by 0SourceScholar
2025

On Momentum Acceleration for Randomized Coordinate Descent in Matrix Completion

ICASSP 2025accepted

Matrix completion plays an important role in machine learning and signal processing, with applications ranging from recommender systems to image inpainting. Many approaches have been considered to solve the problem and some offer computationally efficient solutions. In particular, a highly-efficient…

Cited by 0SourceScholar
2021

Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent

ICASSP 2021accepted

Factorization-based gradient descent is a scalable and efficient algorithm for solving low-rank matrix completion. Recent progress in structured non-convex optimization has offered global convergence guarantees for gradient descent under certain statistical assumptions on the low-rank matrix and the…

Cited by 0SourceScholar
2020

Foreground Signature Extraction for an Intimate Mixing Model in Hyperspectral Image Classification

ICASSP 2020accepted

The hyperspectral unmixing problem arises in remote sensing, chemometrics, and biomedical engineering applications. The spectral signature of a single pixel in a hyperspectral cube can be represented as a non-negative combination of non-negative signatures from various materials contained in the phy…

Cited by 0SourceScholar
2019

Local Convergence of the Heavy Ball Method in Iterative Hard Thresholding for Low-rank Matrix Completion

ICASSP 2019accepted

We present a momentum-based accelerated iterative hard thresholding (IHT) for low-rank matrix completion. We analyze the convergence of the proposed Heavy Ball (HB) accelerated IHT near the solution and provide optimal step size parameters that guarantee the fastest rate of convergence. Since the op…

Cited by 0SourceScholar
2018

Discriminative Probabilistic Framework for Generalized Multi-Instance Learning

ICASSP 2018accepted

Multiple-instance learning is a framework for learning from data consisting of bags of instances labeled at the bag level. A common assumption in multi-instance learning is that a bag label is positive if and only if at least one instance in the bag is positive. In practice, this assumption may be v…

Cited by 0SourceScholar
2017

Online learning of time-frequency patterns

ICASSP 2017accepted

We present an online method to learn recurring time-frequency patterns from spectrograms. Our method relies on a convolutive decomposition that estimates sequences of spectra into time-frequency patterns and their corresponding activation signals. This method processes one spectrogram at a time such…

Cited by 0SourceScholar
2017

Sparse error correction with multiple measurement vectors: Observability-aware approach

ICASSP 2017accepted

We study sparse gross error correction for state estimation in a non-linear sensing system. We consider a practical assumption that gross errors are sparse, and their locations tend to be invariant over a few consecutive measurement periods. Under the assumption, a robust state estimation and error…

Cited by 0SourceScholar
2016

Efficient Multi-Instance Learning for Activity Recognition from Time Series Data Using an Auto-Regressive Hidden Markov Model

ICML 2016poster

Activity recognition from sensor data has spurred a great deal of interest due to its impact on health care. Prior work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort to produce training da…

Cited by 67SourcePDFScholar
2015

Multi-instance multi-label learning in the presence of novel class instances

ICML 2015poster

Multi-instance multi-label learning (MIML) is a framework for learning in the presence of label ambiguity. In MIML, experts provide labels for groups of instances (bags), instead of directly providing a label for every instance. When labeling efforts are focused on a set of target classes, instances…

Cited by 54SourcePDFScholar
2015

Supervised hierarchical segmentation for bird song recording

ICASSP 2015accepted

A common framework of identifying bird species from audio recordings involves detecting bird song segments, which will be subsequently input to a classifier. In-field recordings are contaminated with various environmental noise. For such recordings, supervised segmentation has been observed to outpe…

Cited by 0SourceScholar