default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAniruddh Nath
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Nikhil Khani
, Li Wei, Aniruddh Nath, Shawn Andrews, Shuo Yang, Yang Liu, Pendo Abbo, Maciej Kula, Jarrod Kahn, Zhe Zhao, Lichan Hong, Ed H. Chi:
Bridging the Gap: Unpacking the Hidden Challenges in Knowledge Distillation for Online Ranking Systems. RecSys 2024: 758-761- [i2]Nikhil Khani, Shuo Yang, Aniruddh Nath, Yang Liu, Pendo Abbo, Li Wei, Shawn Andrews, Maciej Kula, Jarrod Kahn, Zhe Zhao, Lichan Hong, Ed H. Chi:
Bridging the Gap: Unpacking the Hidden Challenges in Knowledge Distillation for Online Ranking Systems. CoRR abs/2408.14678 (2024)
2010 – 2019
- 2019
- [c12]Zhe Zhao, Lichan Hong, Li Wei, Jilin Chen, Aniruddh Nath, Shawn Andrews, Aditee Kumthekar, Maheswaran Sathiamoorthy, Xinyang Yi, Ed H. Chi:
Recommending what video to watch next: a multitask ranking system. RecSys 2019: 43-51 - 2016
- [c11]Aniruddh Nath, Pedro M. Domingos:
Learning Tractable Probabilistic Models for Fault Localization. AAAI 2016: 1294-1301 - [c10]Pedro M. Domingos, Daniel Lowd, Stanley Kok, Aniruddh Nath, Hoifung Poon, Matthew Richardson, Parag Singla:
Unifying Logical and Statistical AI. LICS 2016: 1-11 - 2015
- [b1]Aniruddh Nath:
Learning and Exploiting Relational Structure for Efficient Inference. University of Washington, USA, 2015 - [c9]Aniruddh Nath, Pedro M. Domingos:
Learning Relational Sum-Product Networks. AAAI 2015: 2878-2886 - [i1]Aniruddh Nath, Pedro M. Domingos:
Learning Tractable Probabilistic Models for Fault Localization. CoRR abs/1507.01698 (2015) - 2014
- [c8]Aniruddh Nath, Pedro M. Domingos:
Automated Debugging with Tractable Probabilistic Programming. StarAI@AAAI 2014 - [c7]Aniruddh Nath, Pedro M. Domingos:
Learning Tractable Statistical Relational Models. StarAI@AAAI 2014 - [c6]Parag Singla, Aniruddh Nath, Pedro M. Domingos:
Approximate Lifting Techniques for Belief Propagation. AAAI 2014: 2497-2504 - 2012
- [c5]Aniruddh Nath, Matthew Richardson:
Counting-MLNs: Learning Relational Structure for Decision Making. AAAI 2012: 1068-1074 - 2010
- [c4]Aniruddh Nath, Pedro M. Domingos:
Efficient Belief Propagation for Utility Maximization and Repeated Inference. AAAI 2010: 1187-1192 - [c3]Aniruddh Nath, Pedro M. Domingos:
Efficient Lifting for Online Probabilistic Inference. AAAI 2010: 1193-1198 - [c2]Aniruddh Nath, Pedro M. Domingos:
Efficient Lifting for Online Probabilistic Inference. StarAI@AAAI 2010 - [c1]Parag Singla, Aniruddh Nath, Pedro M. Domingos:
Approximate Lifted Belief Propagation. StarAI@AAAI 2010 - [p1]Pedro M. Domingos, Daniel Lowd, Stanley Kok, Aniruddh Nath, Hoifung Poon, Matthew Richardson, Parag Singla:
Markov Logic: A Language and Algorithms for Link Mining. Link Mining 2010: 135-161
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-01-21 00:06 CET 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:
