Liang Dai

Orcid: 0000-0002-7193-8472

Affiliations:
  • University of Uppsala, Department of Information Technology, Sweden


According to our database1, Liang Dai authored at least 11 papers between 2011 and 2016.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Identification using Convexification and Recursion.
PhD thesis, 2016

Using Convolution to Estimate the Score Function for Intractable State-Transition Models.
IEEE Signal Process. Lett., 2016

2015
A New Structure Exploiting Derivation of Recursive Direct Weight Optimization.
IEEE Trans. Autom. Control., 2015

On the Exponential Convergence of the Kaczmarz Algorithm.
IEEE Signal Process. Lett., 2015

Identifiability and convergence analysis of the MINLIP estimator.
Autom., 2015

On the nuclear norm heuristic for a Hankel matrix completion problem.
Autom., 2015

2014
On the Randomized Kaczmarz Algorithm.
IEEE Signal Process. Lett., 2014

Sparse estimation from noisy observations of an overdetermined linear system.
Autom., 2014

2012
On the Nuclear Norm heuristic for a Hankel matrix Recovery Problem
CoRR, 2012

An ellipsoid based, two-stage screening test for BPDN.
Proceedings of the 20th European Signal Processing Conference, 2012

2011
A simple recursive algorithm for learning a Monotone Wiener system.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011


  Loading...