default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin Bello
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Abdolmahdi Bagheri
, Mohammad Pasande, Kevin Bello, Babak Nadjar Araabi, Alireza Akhondi Asl:
Discovering the effective connectome of the brain with dynamic Bayesian DAG learning. NeuroImage 297: 120684 (2024)- [i15]Abdolmahdi Bagheri, Matin Alinejad, Kevin Bello, Alireza Akhondi Asl:
C2P: Featuring Large Language Models with Causal Reasoning. CoRR abs/2407.18069 (2024) - 2023
- [c13]Chang Deng, Kevin Bello, Bryon Aragam, Pradeep Kumar Ravikumar:
Optimizing NOTEARS Objectives via Topological Swaps. ICML 2023: 7563-7595 - [c12]Tianyu Chen, Kevin Bello, Bryon Aragam, Pradeep Ravikumar:
iSCAN: Identifying Causal Mechanism Shifts among Nonlinear Additive Noise Models. NeurIPS 2023 - [c11]Chang Deng, Kevin Bello, Pradeep Ravikumar, Bryon Aragam:
Global Optimality in Bivariate Gradient-based DAG Learning. NeurIPS 2023 - [i14]Chang Deng, Kevin Bello, Bryon Aragam, Pradeep Ravikumar:
Optimizing NOTEARS Objectives via Topological Swaps. CoRR abs/2305.17277 (2023) - [i13]Tianyu Chen, Kevin Bello, Bryon Aragam, Pradeep Ravikumar:
iSCAN: Identifying Causal Mechanism Shifts among Nonlinear Additive Noise Models. CoRR abs/2306.17361 (2023) - [i12]Chang Deng, Kevin Bello, Bryon Aragam, Pradeep Ravikumar:
Global Optimality in Bivariate Gradient-based DAG Learning. CoRR abs/2306.17378 (2023) - [i11]Abdolmahdi Bagheri, Mohammad Pasande, Kevin Bello, Alireza Akhondi Asl, Babak Nadjar Araabi:
Bayesian Dynamic DAG Learning: Application in Discovering Dynamic Effective Connectome of Brain. CoRR abs/2309.07080 (2023) - 2022
- [c10]Kevin Bello, Chuyang Ke, Jean Honorio:
A View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy. AISTATS 2022: 640-654 - [c9]Hanbyul Lee, Kevin Bello, Jean Honorio:
On the Fundamental Limits of Exact Inference in Structured Prediction. ISIT 2022: 3174-3179 - [c8]Kevin Bello, Bryon Aragam, Pradeep Ravikumar:
DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterization. NeurIPS 2022 - [i10]Kevin Bello, Bryon Aragam, Pradeep Ravikumar:
DAGMA: Learning DAGs via M-matrices and a Log-Determinant Acyclicity Characterization. CoRR abs/2209.08037 (2022) - 2021
- [c7]Qiuling Xu, Kevin Bello, Jean Honorio:
A Le Cam Type Bound for Adversarial Learning and Applications. ISIT 2021: 1164-1169 - [c6]Gregory Dexter, Kevin Bello, Jean Honorio:
Inverse Reinforcement Learning in a Continuous State Space with Formal Guarantees. NeurIPS 2021: 6972-6982 - [i9]Gregory Dexter, Kevin Bello, Jean Honorio:
Inverse Reinforcement Learning in the Continuous Setting with Formal Guarantees. CoRR abs/2102.07937 (2021) - [i8]Kevin Bello, Chuyang Ke, Jean Honorio:
A Thorough View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy. CoRR abs/2102.08019 (2021) - [i7]Hanbyul Lee, Kevin Bello, Jean Honorio:
On the Fundamental Limits of Exact Inference in Structured Prediction. CoRR abs/2102.08895 (2021) - 2020
- [c5]Kevin Bello, Asish Ghoshal, Jean Honorio:
Minimax Bounds for Structured Prediction Based on Factor Graphs. AISTATS 2020: 213-222 - [c4]Kevin Bello, Jean Honorio:
Fairness constraints can help exact inference in structured prediction. NeurIPS 2020 - [i6]Kevin Bello, Jean Honorio:
Fairness constraints can help exact inference in structured prediction. CoRR abs/2007.00218 (2020) - [i5]Kevin Bello, Qiuling Xu, Jean Honorio:
Fundamental Limits of Adversarial Learning. CoRR abs/2007.00289 (2020)
2010 – 2019
- 2019
- [c3]Kevin Bello, Jean Honorio:
Exact inference in structured prediction. NeurIPS 2019: 3693-3702 - [i4]Kevin Bello, Asish Ghoshal, Jean Honorio:
Minimax bounds for structured prediction. CoRR abs/1906.00449 (2019) - [i3]Kevin Bello, Jean Honorio:
Exact inference in structured prediction. CoRR abs/1906.00451 (2019) - 2018
- [j1]Ronald Cardenas, Kevin Bello, Alberto Coronado, Elizabeth Villota:
Improving Topic Coherence Using Entity Extraction Denoising. Prague Bull. Math. Linguistics 110: 85-101 (2018) - [c2]Kevin Bello, Jean Honorio:
Learning latent variable structured prediction models with Gaussian perturbations. NeurIPS 2018: 3149-3159 - [c1]Kevin Bello, Jean Honorio:
Computationally and statistically efficient learning of causal Bayes nets using path queries. NeurIPS 2018: 10954-10964 - [i2]Kevin Bello, Jean Honorio:
Learning latent variable structured prediction models with Gaussian perturbations. CoRR abs/1805.09213 (2018) - 2017
- [i1]Kevin Bello, Jean Honorio:
Learning Bayes networks using interventional path queries in polynomial time and sample complexity. CoRR abs/1706.00754 (2017)
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 2024-08-25 20:06 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:
