Which graphical models are difficult to learn? - José Bento 001; Andrea Montanari (CoRR, 2009)

The LASSO risk: asymptotic results and real world examples. - Mohsen Bayati; José Bento 001; Andrea Montanari (NIPS, 2010)

Learning Networks of Stochastic Differential Equations. - José Bento 001; Morteza Ibrahimi; Andrea Montanari (NIPS, 2010)

Probabilistic document model for automated document composition. - Niranjan Damera-Venkata; José Bento 001; Eamonn O'Brien-Strain (ACM Symposium on Document Engineering, 2011)

Information theoretic limits on learning stochastic differential equations. - José Bento 001; Morteza Ibrahimi; Andrea Montanari (ISIT, 2011)

On the trade-off between complexity and correlation decay in structural learning algorithms - José Bento 001; Andrea Montanari (CoRR, 2011)

Ad insertion in automatically composed documents. - Niranjan Damera-Venkata; José Bento 001 (ACM Symposium on Document Engineering, 2012)

Group recommendations via multi-armed bandits. - José Bento 001; Stratis Ioannidis; S. Muthukrishnan 001; Jinyun Yan (WWW (Companion Volume), 2012)

Identifying Users From Their Rating Patterns - José Bento 001; Nadia Fawaz; Andrea Montanari; Stratis Ioannidis (CoRR, 2012)

Methods for Integrating Knowledge with the Three-Weight Optimization Algorithm for Hybrid Cognitive Processing. - Nate Derbinsky; José Bento 001; Jonathan S. Yedidia (AAAI Fall Symposia, 2013)

A message-passing algorithm for multi-agent trajectory planning. - José Bento 001; Nate Derbinsky; Javier Alonso-Mora; Jonathan S. Yedidia (NIPS, 2013)

A Time and Space Efficient Algorithm for Contextual Linear Bandits. - José Bento 001; Stratis Ioannidis; S. Muthukrishnan 001; Jinyun Yan (ECML/PKDD (1), 2013)

An Improved Three-Weight Message-Passing Algorithm - Nate Derbinsky; José Bento 001; Veit Elser; Jonathan S. Yedidia (CoRR, 2013)

Shape and Illumination from Shading using the Generic Viewpoint Assumption. - Daniel Zoran; Dilip Krishnan; José Bento 001; Bill Freeman (NIPS, 2014)

Support Recovery for the Drift Coefficient of High-Dimensional Diffusions. - José Bento Ayres Pereira; Morteza Ibrahimi (IEEE Trans. Inf. Theory, 2014)

Proximal Operators for Multi-Agent Path Planning. - José Bento 001; Nate Derbinsky; Charles Mathy; Jonathan S. Yedidia (AAAI, 2015)

The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning. - Charles Mathy; Nate Derbinsky; José Bento 001; Jonathan Rosenthal; Jonathan S. Yedidia (AAAI, 2015)

Testing Fine-Grained Parallelism for the ADMM on a Factor-Graph. - Ning Hao; AmirReza Oghbaee; Mohammad Rostami; Nate Derbinsky; José Bento 001 (IPDPS Workshops, 2016)

An explicit rate bound for over-relaxed ADMM. - Guilherme França; José Bento 001 (ISIT, 2016)

Line-Drawing Video Stylization. - N. Ben-Zvi; José Bento 001; Moshe Mahler; Jessica K. Hodgins; Ariel Shamir (Comput. Graph. Forum, 2016)

A metric for sets of trajectories that is practical and mathematically consistent. - José Bento 001 (CoRR, 2016)

Generative Adversarial Active Learning. - Jia-Jie Zhu; José Bento 001 (CoRR, 2017)

Markov Chain Lifting and Distributed ADMM. - Guilherme França; José Bento 001 (IEEE Signal Process. Lett., 2017)

An Explicit Convergence Rate for Nesterov's Method from SDP. - Sam Safavi; Bikash Joshi; Guilherme França; José Bento 001 (ISIT, 2018)

Efficient Projection onto the Perfect Phylogeny Model. - Bei Jia; Surjyendu Ray; Sam Safavi; José Bento 001 (NeurIPS, 2018)

A Family of Tractable Graph Distances. - José Bento 001; Stratis Ioannidis (SDM, 2018)

On the Complexity of the Weighted Fussed Lasso. - José Bento 001; Surjyendu Ray (CoRR, 2018)

n-metrics for multiple graph alignment. - Sam Safavi; José Bento 001 (CoRR, 2018)

Genome-scale estimation of cellular objectives. - Laurence Yang 001; José Bento 001; Jean-Christophe Lachance; Bernhard O. Palsson (CoRR, 2018)

On the Complexity of the Weighted Fused Lasso. - José Bento 001; Ralph Furmaniak; Surjyendu Ray (IEEE Signal Process. Lett., 2018)

Tractable n-Metrics for Multiple Graphs. - Sam Safavi; José Bento 001 (ICML, 2019)

Estimating Cellular Goals from High-Dimensional Biological Data. - Laurence Yang 001; Michael A. Saunders; Jean-Christophe Lachance; Bernhard O. Palsson; José Bento 001 (KDD, 2019)

A family of tractable graph metrics. - José Bento 001; Stratis Ioannidis (Appl. Netw. Sci., 2019)

Exact inference under the perfect phylogeny model. - Surjyendu Ray; Bei Jia; Sam Safavi; Tim van Opijnen; Ralph Isberg; Jason Rosch; José Bento 001 (CoRR, 2019)

Multi-Marginal Optimal Transport Defines a Generalized Metric. - Liang Mi; José Bento 001 (CoRR, 2020)

Variational Wasserstein Barycenters for Geometric Clustering. - Liang Mi; Tianshu Yu 001; José Bento 001; Wen Zhang 010; Baoxin Li; Yalin Wang 001 (CoRR, 2020)

Distributed Optimization, Averaging via ADMM, and Network Topology. - Guilherme França; José Bento 001 (Proc. IEEE, 2020)

Massively Distributed Graph Distances. - Armin Moharrer; Jasmin Gao; Shikun Wang; José Bento 001; Stratis Ioannidis (IEEE Trans. Signal Inf. Process. over Networks, 2020)

Optimal Activation Functions for the Random Features Regression Model. - Jianxin Wang; José Bento 001 (ICLR, 2023)

Revisiting Self-Training with Regularized Pseudo-Labeling for Tabular Data. - Minwook Kim; Juseong Kim; José Bento 001; Giltae Song (CoRR, 2023)

A family of pairwise multi-marginal optimal transports that define a generalized metric. - Liang Mi; Azadeh Sheikholeslami; José Bento 001 (Mach. Learn., 2023)

Information-Oriented and Energy-Aware Path Planning for Small Unmanned Aerial Vehicles. - José Bento 001; Meysam Basiri; Rodrigo Ventura 001 (EPIA (3), 2024)

Information-Oriented and Energy-Aware Path Planning for Multiple Air-Dropped Small Unmanned Aerial Vehicles. - José Bento 001; Meysam Basiri; Rodrigo Ventura 001 (ROBOT, 2024)