Picture for Mathukumalli Vidyasagar

Mathukumalli Vidyasagar

A Tutorial Introduction to Reinforcement Learning

Add code
Apr 03, 2023
Viaarxiv icon

Convergence of Momentum-Based Heavy Ball Method with Batch Updating and/or Approximate Gradients

Add code
Mar 28, 2023
Viaarxiv icon

Estimating large causal polytree skeletons from small samples

Add code
Sep 15, 2022
Figure 1 for Estimating large causal polytree skeletons from small samples
Viaarxiv icon

Deterministic Completion of Rectangular Matrices Using Ramanujan Bigraphs -- II: Explicit Constructions and Phase Transitions

Add code
Oct 08, 2019
Figure 1 for Deterministic Completion of Rectangular Matrices Using Ramanujan Bigraphs -- II: Explicit Constructions and Phase Transitions
Figure 2 for Deterministic Completion of Rectangular Matrices Using Ramanujan Bigraphs -- II: Explicit Constructions and Phase Transitions
Figure 3 for Deterministic Completion of Rectangular Matrices Using Ramanujan Bigraphs -- II: Explicit Constructions and Phase Transitions
Figure 4 for Deterministic Completion of Rectangular Matrices Using Ramanujan Bigraphs -- II: Explicit Constructions and Phase Transitions
Viaarxiv icon

Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs

Add code
Aug 02, 2019
Figure 1 for Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs
Figure 2 for Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs
Figure 3 for Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs
Figure 4 for Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs
Viaarxiv icon

Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions

Add code
Sep 27, 2018
Figure 1 for Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
Figure 2 for Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
Figure 3 for Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
Figure 4 for Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
Viaarxiv icon

Tight Performance Bounds for Compressed Sensing With Conventional and Group Sparsity

Add code
Jul 28, 2018
Figure 1 for Tight Performance Bounds for Compressed Sensing With Conventional and Group Sparsity
Viaarxiv icon

A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices

Add code
May 21, 2018
Figure 1 for A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
Figure 2 for A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
Figure 3 for A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
Figure 4 for A Fast Noniterative Algorithm for Compressive Sensing Using Binary Measurement Matrices
Viaarxiv icon

An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory

Add code
Oct 22, 2017
Figure 1 for An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory
Figure 2 for An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory
Figure 3 for An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory
Figure 4 for An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory
Viaarxiv icon

Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect

Add code
Jun 20, 2017
Figure 1 for Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect
Figure 2 for Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect
Viaarxiv icon