activity
20122026
most citedAlternating Least-Squares for Low-Rank Matrix Reconstruction

57 citations · 214 across the 16 of their papers we have counts for

collaborators

18 papers

cs.LG2026

A Semiparametric Framework for Stochastic Fundamental Diagram Modeling

Pengnan Chi, Xiaoliang Ma, Magnus Jansson +1

The stochastic fundamental diagram (SFD) provides a probabilistic description of the relationship between traffic density and flow or speed, enabling uncertainty-aware traffic mode…

stat.ML2017

A Connectedness Constraint for Learning Sparse Graphs

Martin Sundin, Arun Venkitaraman, Magnus Jansson +1

Graphs are naturally sparse objects that are used to study many problems involving networks, for example, distributed learning and graph signal processing. In some cases, the graph…

cs.IT2015★ 41 cited

Successive Concave Sparsity Approximation for Compressed Sensing

Mohammadreza Malek-Mohammadi, Ali Koochakzadeh, Massoud Babaie-Zadeh +2

In this paper, based on a successively accuracy-increasing approximation of the norm, we propose a new algorithm for recovery of sparse vectors from underdetermined measur…

cs.IT2015

Upper Bounds on the Error of Sparse Vector and Low-Rank Matrix Recovery

Mohammadreza Malek-Mohammadi, Cristian R. Rojas, Magnus Jansson +1

Suppose that a solution to an underdetermined linear system is given. is approximately sparse…

stat.ML2015★ 1 cited

Bayesian Learning for Low-Rank matrix reconstruction

Martin Sundin, Cristian R. Rojas, Magnus Jansson +1

We develop latent variable models for Bayesian learning based low-rank matrix completion and reconstruction from linear measurements. For under-determined systems, the developed me…

stat.AP2015

Ranging without time stamps exchanging

Mohammad Reza Gholami, Satyam Dwivedi, Magnus Jansson +1

We investigate the range estimate between two wireless nodes without time stamps exchanging. Considering practical aspects of oscillator clocks, we propose a new model for ranging…