We stand with Ukraine

We stand with Ukraine

José Bento

Orcid: 0000-0003-1835-1530

Affiliations:

Boston College, MA, USA
Stanford University, Electrical Engineering Department, CA, USA (former)

According to our database¹, José Bento authored at least 41 papers between 2009 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2023

A family of pairwise multi-marginal optimal transports that define a generalized metric.

[BibT_eX]

[DOI]

,

Azadeh Sheikholeslami

,

Mach. Learn., January, 2023

Revisiting Self-Training with Regularized Pseudo-Labeling for Tabular Data.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2023

Optimal Activation Functions for the Random Features Regression Model.

[BibT_eX]

[DOI]

,

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2020

Massively Distributed Graph Distances.

[BibT_eX]

[DOI]

,

,

,

,

Stratis Ioannidis

IEEE Trans. Signal Inf. Process. over Networks, 2020

Distributed Optimization, Averaging via ADMM, and Network Topology.

[BibT_eX]

[DOI]

Guilherme França

,

Proc. IEEE, 2020

Variational Wasserstein Barycenters for Geometric Clustering.

[BibT_eX]

[DOI]

,

,

,

,

,

CoRR, 2020

Multi-Marginal Optimal Transport Defines a Generalized Metric.

[BibT_eX]

[DOI]

,

CoRR, 2020

2019

Exact inference under the perfect phylogeny model.

[BibT_eX]

[DOI]

,

,

,

Tim van Opijnen

,

,

,

CoRR, 2019

A family of tractable graph metrics.

[BibT_eX]

[DOI]

,

Stratis Ioannidis

Appl. Netw. Sci., 2019

Estimating Cellular Goals from High-Dimensional Biological Data.

[BibT_eX]

[DOI]

,

Michael A. Saunders

,

Jean-Christophe Lachance

,

Bernhard O. Palsson

,

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Tractable n-Metrics for Multiple Graphs.

[BibT_eX]

[DOI]

,

Proceedings of the 36th International Conference on Machine Learning, 2019

2018

On the Complexity of the Weighted Fused Lasso.

[BibT_eX]

[DOI]

,

Ralph Furmaniak

,

IEEE Signal Process. Lett., 2018

Genome-scale estimation of cellular objectives.

[BibT_eX]

[DOI]

,

,

Jean-Christophe Lachance

,

Bernhard O. Palsson

CoRR, 2018

n-metrics for multiple graph alignment.

[BibT_eX]

[DOI]

,

CoRR, 2018

On the Complexity of the Weighted Fussed Lasso.

[BibT_eX]

[DOI]

,

CoRR, 2018

A Family of Tractable Graph Distances.

[BibT_eX]

[DOI]

,

Stratis Ioannidis

Proceedings of the 2018 SIAM International Conference on Data Mining, 2018

Efficient Projection onto the Perfect Phylogeny Model.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

An Explicit Convergence Rate for Nesterov's Method from SDP.

[BibT_eX]

[DOI]

,

,

Guilherme França

,

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Markov Chain Lifting and Distributed ADMM.

[BibT_eX]

[DOI]

Guilherme França

,

IEEE Signal Process. Lett., 2017

Generative Adversarial Active Learning.

[BibT_eX]

[DOI]

,

CoRR, 2017

2016

A metric for sets of trajectories that is practical and mathematically consistent.

[BibT_eX]

[DOI]

CoRR, 2016

Line-Drawing Video Stylization.

[BibT_eX]

[DOI]

,

,

,

Jessica K. Hodgins

,

Comput. Graph. Forum, 2016

An explicit rate bound for over-relaxed ADMM.

[BibT_eX]

[DOI]

Guilherme França

,

Proceedings of the IEEE International Symposium on Information Theory, 2016

Testing Fine-Grained Parallelism for the ADMM on a Factor-Graph.

[BibT_eX]

[DOI]

,

AmirReza Oghbaee

,

Mohammad Rostami

,

,

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

2015

The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning.

[BibT_eX]

[DOI]

,

,

,

Jonathan Rosenthal

,

Jonathan S. Yedidia

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Proximal Operators for Multi-Agent Path Planning.

[BibT_eX]

[DOI]

,

,

,

Jonathan S. Yedidia

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Support Recovery for the Drift Coefficient of High-Dimensional Diffusions.

[BibT_eX]

[DOI]

José Bento Ayres Pereira

,

Morteza Ibrahimi

IEEE Trans. Inf. Theory, 2014

Shape and Illumination from Shading using the Generic Viewpoint Assumption.

[BibT_eX]

[DOI]

,

,

,

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013

An Improved Three-Weight Message-Passing Algorithm

[BibT_eX]

[DOI]

,

,

,

Jonathan S. Yedidia

CoRR, 2013

A Time and Space Efficient Algorithm for Contextual Linear Bandits.

[BibT_eX]

[DOI]

,

Stratis Ioannidis

,

S. Muthukrishnan

,

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

A message-passing algorithm for multi-agent trajectory planning.

[BibT_eX]

[DOI]

,

,

Javier Alonso-Mora

,

Jonathan S. Yedidia

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Methods for Integrating Knowledge with the Three-Weight Optimization Algorithm for Hybrid Cognitive Processing.

[BibT_eX]

[DOI]

,

,

Jonathan S. Yedidia

Proceedings of the 2013 AAAI Fall Symposia, Arlington, Virginia, USA, November 15-17, 2013, 2013

2012

Identifying Users From Their Rating Patterns

[BibT_eX]

[DOI]

,

,

Andrea Montanari

,

Stratis Ioannidis

CoRR, 2012

Group recommendations via multi-armed bandits.

[BibT_eX]

[DOI]

,

Stratis Ioannidis

,

S. Muthukrishnan

,

Proceedings of the 21st World Wide Web Conference, 2012

Ad insertion in automatically composed documents.

[BibT_eX]

[DOI]

Niranjan Damera-Venkata

,

Proceedings of the ACM Symposium on Document Engineering, 2012

2011

On the trade-off between complexity and correlation decay in structural learning algorithms

[BibT_eX]

[DOI]

,

Andrea Montanari

CoRR, 2011

Information theoretic limits on learning stochastic differential equations.

[BibT_eX]

[DOI]

,

Morteza Ibrahimi

,

Andrea Montanari

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Probabilistic document model for automated document composition.

[BibT_eX]

[DOI]

Niranjan Damera-Venkata

,

,

Eamonn O'Brien-Strain

Proceedings of the 2011 ACM Symposium on Document Engineering, 2011

2010

Learning Networks of Stochastic Differential Equations.

[BibT_eX]

[DOI]

,

Morteza Ibrahimi

,

Andrea Montanari

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

The LASSO risk: asymptotic results and real world examples.

[BibT_eX]

[DOI]

,

,

Andrea Montanari

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009

Which graphical models are difficult to learn?

[BibT_eX]

[DOI]

,

Andrea Montanari

CoRR, 2009

Loading...