◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. S. Veedu

6 papers hereh-index 466 citations8 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author4
  • middle author1

Across the 5 of 6 papers where every author was matched, so the position is known.

fields
  • eess.SY3
  • cs.IT1
  • cs.LG1
  • stat.ML1

identity via Semantic Scholar / OpenAlex

activity
20192025
most citedTopology Learning of Linear Dynamical Systems with Latent Nodes using Matrix Decomposition

3 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing stat.MLShow all

1 paper · 1 filter

stat.ML2023

Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs

Mishfad Shaikh Veedu, Deepjyoti Deka, Murti V. Salapaka

In this article, the optimal sample complexity of learning the underlying interactions or dependencies of a Linear Dynamical System (LDS) over a Directed Acyclic Graph (DAG) is stu…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.