Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFeras Saad
Person information
- affiliation: Carnegie Mellon University, PA, USA
- affiliation (former): Massachusetts Institute of Technology, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i13]Feras Saad, Jacob Burnim, Colin Carroll, Brian Patton, Urs Köster, Rif A. Saurous, Matthew Hoffman:
Scalable Spatiotemporal Prediction with Bayesian Neural Fields. CoRR abs/2403.07657 (2024)- 2023
- [c10]Feras Saad, Brian Patton, Matthew Douglas Hoffman, Rif A. Saurous, Vikash Mansinghka:
Sequential Monte Carlo Learning for Time Series Structure Discovery. ICML 2023: 29473-29489 - [i12]Feras A. Saad, Brian J. Patton, Matthew D. Hoffman, Rif A. Saurous, Vikash K. Mansinghka:
Sequential Monte Carlo Learning for Time Series Structure Discovery. CoRR abs/2307.09607 (2023) - 2022
- [c9]Feras Saad, Marco F. Cusumano-Towner, Vikash Mansinghka:
Estimators of Entropy and Information via Inference in Probabilistic Models. AISTATS 2022: 5604-5621 - [i11]Feras A. Saad, Marco F. Cusumano-Towner, Vikash K. Mansinghka:
Estimators of Entropy and Information via Inference in Probabilistic Models. CoRR abs/2202.12363 (2022) - 2021
- [c8]Feras A. Saad
, Martin C. Rinard, Vikash K. Mansinghka:
SPPL: probabilistic programming with fast exact symbolic inference. PLDI 2021: 804-819 - [c7]Feras A. Saad, Vikash K. Mansinghka:
Hierarchical infinite relational model. UAI 2021: 1067-1077 - [i10]Feras A. Saad, Vikash K. Mansinghka:
Hierarchical Infinite Relational Model. CoRR abs/2108.07208 (2021) - 2020
- [j2]Feras A. Saad, Cameron E. Freer, Martin C. Rinard, Vikash K. Mansinghka:
Optimal approximate sampling from discrete probability distributions. Proc. ACM Program. Lang. 4(POPL): 36:1-36:31 (2020) - [c6]Feras Saad, Cameron E. Freer, Martin C. Rinard, Vikash Mansinghka:
The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions. AISTATS 2020: 1036-1046 - [i9]Feras A. Saad, Cameron E. Freer, Martin C. Rinard, Vikash K. Mansinghka:
Optimal Approximate Sampling from Discrete Probability Distributions. CoRR abs/2001.04555 (2020) - [i8]Feras A. Saad, Cameron E. Freer, Martin C. Rinard, Vikash K. Mansinghka:
The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions. CoRR abs/2003.03830 (2020) - [i7]Feras A. Saad, Martin C. Rinard, Vikash K. Mansinghka:
Exact Symbolic Inference in Probabilistic Programs via Sum-Product Representations. CoRR abs/2010.03485 (2020)
2010 – 2019
- 2019
- [j1]Feras A. Saad, Marco F. Cusumano-Towner, Ulrich Schaechtle, Martin C. Rinard, Vikash K. Mansinghka:
Bayesian synthesis of probabilistic programs for automatic data modeling. Proc. ACM Program. Lang. 3(POPL): 37:1-37:32 (2019) - [c5]Feras A. Saad, Cameron E. Freer, Nathanael L. Ackerman, Vikash K. Mansinghka:
A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions. AISTATS 2019: 1640-1649 - [c4]Marco F. Cusumano-Towner, Feras A. Saad, Alexander K. Lew, Vikash K. Mansinghka:
Gen: a general-purpose probabilistic programming system with programmable inference. PLDI 2019: 221-236 - [i6]Feras A. Saad, Cameron E. Freer, Nathanael L. Ackerman, Vikash K. Mansinghka:
A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions. CoRR abs/1902.10142 (2019) - [i5]Feras A. Saad, Marco F. Cusumano-Towner, Ulrich Schaechtle, Martin C. Rinard, Vikash K. Mansinghka:
Bayesian Synthesis of Probabilistic Programs for Automatic Data Modeling. CoRR abs/1907.06249 (2019) - 2018
- [c3]Feras Saad, Vikash Mansinghka:
Temporally-Reweighted Chinese Restaurant Process Mixtures for Clustering, Imputing, and Forecasting Multivariate Time Series. AISTATS 2018: 755-764 - 2017
- [c2]Feras Saad, Vikash Mansinghka:
Detecting Dependencies in Sparse, Multivariate Databases Using Probabilistic Programming and Non-parametric Bayes. AISTATS 2017: 632-641 - [i4]Feras Saad, Leonardo Casarsa, Vikash Mansinghka:
Probabilistic Search for Structured Data via Probabilistic Programming and Nonparametric Bayes. CoRR abs/1704.01087 (2017) - [i3]Feras A. Saad, Vikash K. Mansinghka:
A Bayesian Nonparametric Method for Clustering Imputation, and Forecasting in Multivariate Time Series. CoRR abs/1710.06900 (2017) - 2016
- [c1]Feras Saad, Vikash K. Mansinghka:
A Probabilistic Programming Approach To Probabilistic Data Analysis. NIPS 2016: 2011-2019 - [i2]Feras Saad, Vikash Mansinghka:
Probabilistic Data Analysis with Probabilistic Programming. CoRR abs/1608.05347 (2016) - [i1]Feras Saad, Vikash Mansinghka:
Detecting Dependencies in High-Dimensional, Sparse Databases Using Probabilistic Programming and Non-parametric Bayes. CoRR abs/1611.01708 (2016)
Coauthor Index
aka: Vikash K. Mansinghka
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 2024-05-08 23:47 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:
