default search action
Saurabh Mathur 0002
Person information
- affiliation: University of Texas at Dallas, Department of Computer Science, TX, USA
- affiliation (former): Vellore Institute of Technology (VIT), School of Information Technology and Engineering, Vellore, Tamil Nadu, India
Other persons with the same name
- Saurabh Mathur — disambiguation page
- Saurabh Mathur 0001 — Thomson Inc, Corporate Research Lab, Princeton, NJ, USA
- Saurabh Mathur 0003 — Columbia University, New York, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [c8]Athresh Karanam, Saurabh Mathur, Sahil Sidheekh, Sriraam Natarajan:
A Unified Framework for Human-Allied Learning of Probabilistic Circuits. AAAI 2025: 17779-17787 - [c7]Sriraam Natarajan, Saurabh Mathur, Sahil Sidheekh, Wolfgang Stammer, Kristian Kersting:
Human-in-the-loop or AI-in-the-loop? Automate or Collaborate? AAAI 2025: 28594-28600 - 2024
- [c6]Saurabh Mathur, Veerendra P. Gadekar, Rashika Ramola, Peixin Wang, Ramachandran Thiruvengadam, David M. Haas, Shinjini Bhatnagar, Nitya Wadhwa, Garbhini Study Group, Predrag Radivojac, Himanshu Sinha, Kristian Kersting, Sriraam Natarajan:
Modeling Multiple Adverse Pregnancy Outcomes: Learning from Diverse Data Sources. AIME (1) 2024: 293-302 - [c5]Sahil Sidheekh
, Saurabh Mathur
Deep Tractable Probabilistic Models. COMAD/CODS 2024: 501-504 - [c4]Sahil Sidheekh, Pranuthi Tenali, Saurabh Mathur, Erik Blasch, Sriraam Natarajan:
On the Robustness and Reliability of Late Multi-Modal Fusion using Probabilistic Circuits. FUSION 2024: 1-8 - [c3]Saurabh Mathur, Alessandro Antonucci, Sriraam Natarajan:
Knowledge Intensive Learning of Credal Networks. UAI 2024: 2516-2526 - [i4]Sahil Sidheekh, Pranuthi Tenali, Saurabh Mathur, Erik Blasch, Kristian Kersting, Sriraam Natarajan:
Credibility-Aware Multi-Modal Fusion Using Probabilistic Circuits. CoRR abs/2403.03281 (2024) - [i3]Athresh Karanam, Saurabh Mathur, Sahil Sidheekh, Sriraam Natarajan:
A Unified Framework for Human-Allied Learning of Probabilistic Circuits. CoRR abs/2405.02413 (2024) - [i2]Sriraam Natarajan, Saurabh Mathur, Sahil Sidheekh, Wolfgang Stammer, Kristian Kersting:
Human-in-the-loop or AI-in-the-loop? Automate or Collaborate? CoRR abs/2412.14232 (2024) - 2023
- [c2]Saurabh Mathur, Vibhav Gogate
Knowledge Intensive Learning of Cutset Networks. UAI 2023: 1380-1389 - 2022
- [c1]Athresh Karanam, Saurabh Mathur, Predrag Radivojac, David M. Haas, Kristian Kersting, Sriraam Natarajan:
Explaining Deep Tractable Probabilistic Models: The sum-product network case. PGM 2022: 325-336 - 2021
- [i1]Athresh Karanam, Saurabh Mathur, Predrag Radivojac, Kristian Kersting, Sriraam Natarajan:
Explaining Deep Tractable Probabilistic Models: The sum-product network case. CoRR abs/2110.09778 (2021)
2010 – 2019
- 2019
- [j1]Saurabh Mathur
A scaled-down neural conversational model for chatbots. Concurr. Comput. Pract. Exp. 31(10) (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-20 23:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: