Embedded Files
Hello, I am Siddhartha Satpathi. I am currently interested in design and analysis of algorithms in machine learning with a focus on deep learning in healthcare. I have worked on applying machine learning algorithms in areas like recommendation systems and anomaly detection in networks. Before my PhD, I have worked on problems in sparse signal processing and green communication.
Email: sidd.piku@gmail.com;
Education:
Internships:
Teaching Assistanship:
Publications:
Sept 2021 - present
Post-doctoral Fellow at the Mayo clinic
2015 - Aug. 2021
Graduate Student in Electrical Engineering at the University of Illinois at Urbana-Champaign (UIUC).
Advisor: R. Srikant
2010 - 2015.
Dual Degree (B.Tech + M.Tech) at Dept of Electronics and Electrical Communication, Indian Institute Technology (IIT) Kharagpur, INDIA.
Minor in Computer Science.
Advisor: Mrityunjoy Chakraborty
Nokia Bell Labs [Summer 2018]
Ecole Polytechnique Federale De Laussane(EPFL) [Summer 2013, 2015]
Tata Institute of Fundamental Research(TIFR) [Summer 2014]
Game Theory (Fall 2018), Control of Stochastic Systems (Fall 2020).
Sample Complexity and Overparameterization Bounds for Projection-Free Neural TD Learning.
[Submitted]
The Dynamics of Gradient Descent for Overparametrized Neural Networks.
Siddhartha Satpathi and R Srikant.
[3rd Annual Learning for Dynamics & Control Conference (L4DC) 2021. ]
The Role of Regularization in Overparameterized Neural Networks.
Siddhartha Satpathi, Harsh Gupta, Shiyu Liang and R Srikant.
[IEEE Conference on Decision and Control, 2020][pdf]
Learning Latent Events from Network Message Logs.
Siddhartha Satpathi, Supratim Deb, R Srikant and He Yan.
[Workshop on MiLeTS, SIGKDD 2018][Full version]
[IEEE/ACM Transactions on Networking]
[preprint] Perfect Clustering From Pairwise Comparisons.
Barbara Dembin, Siddhartha Satpathi and R Srikant.
[30 min talk by Srikant at Simons Institute, Berkeley][MS thesis]
Optimal Offline and Competitive Online Strategies for Transmitter-Receiver Energy Harvesting.
Siddhartha Satpathi, Rushil Nagda and Rahul Vaze.
IEEE Transactions on information theory, 2016.
IEEE International Conference on Communications (ICC) 2015 with Rushil Nagda, Siddhartha Satpathi and Rahul Vaze.
[arxiv] [IEEE version] [ICC simplified version in arxiv]
Group-Sparse Model Selection: Hardness and Relaxations.
Luca Baldassarre, Nirav Bhan, Volkan Cevher, Anastasios Kyrillidis and Siddhartha Satpathi.
IEEE Transactions on Information Theory, 2016.
[arxiv] [IEEE version]
Sparse group covers and greedy tree approximations.
Siddhartha Satpathi, Luca Baldassarre and Volkan Cevher.
IEEE International Symposium on Information Theory (ISIT) 2015.
[pdf] [IEEE version]
On the number of iterations for convergence of CoSaMP and Subspace Pursuit algorithms.
Siddhartha Satpathi and Mrityunjoy Chakraborty.
Applied and Computational Harmonic Analysis, 2016.
Improving the Bound on the RIP Constant in Generalized Orthogonal Matching Pursuit.
Siddhartha Satpathi, Rajib Lochan Das and Mrityunjoy Chakraborty.
IEEE Signal Processing Letters, 2013.
[arxiv] [IEEE version]
Page updated
Google Sites
Report abuse