b'Jos\xc3\xa9 Bento'

research

∙ 02/27/2023

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

Recent progress in semi- and self-supervised learning has caused a rift ...

0 Minwook Kim, et al. ∙

research

∙ 05/31/2022

Optimal Activation Functions for the Random Features Regression Model

The asymptotic mean squared test error and sensitivity of the Random Fea...

0 Jianxin Wang, et al. ∙

research

∙ 09/05/2020

Distributed Optimization, Averaging via ADMM, and Network Topology

There has been an increasing necessity for scalable optimization methods...

11 Guilherme França, et al. ∙

research

∙ 02/24/2020

Variational Wasserstein Barycenters for Geometric Clustering

We propose to compute Wasserstein barycenters (WBs) by solving for Monge...

12 Liang Mi, et al. ∙

research

∙ 01/29/2020

Multi-Marginal Optimal Transport Defines a Generalized Metric

We prove that the multi-marginal optimal transport (MMOT) problem define...

3 Liang Mi, et al. ∙

research

∙ 08/22/2019

Exact inference under the perfect phylogeny model

Motivation: Many inference tools use the Perfect Phylogeny Model (PPM) t...

0 Surjyendu Ray, et al. ∙

research

∙ 11/03/2018

Efficient Projection onto the Perfect Phylogeny Model

Several algorithms build on the perfect phylogeny model to infer evoluti...

0 Bei Jia, et al. ∙

research

∙ 07/11/2018

Genome-scale estimation of cellular objectives

Cellular metabolism is predicted accurately at the genome-scale using co...

0 Laurence Yang, et al. ∙

research

∙ 07/09/2018

How should we (correctly) compare multiple graphs?

Graphs are used in almost every scientific discipline to express relatio...

0 Sam Safavi, et al. ∙

research

∙ 07/09/2018

n-metrics for multiple graph alignment

The work of Ioannidis et al. 2018 introduces a family of distances betwe...

0 Sam Safavi, et al. ∙

research

∙ 01/15/2018

On the Complexity of the Weighted Fused Lasso

The solution path of the 1D fused lasso for an n-dimensional input is pi...

0 José Bento, et al. ∙

research

∙ 01/15/2018

On the Complexity of the Weighted Fussed Lasso

The solution path of the 1D fused lasso for an n-dimensional input is pi...

0 José Bento, et al. ∙

research

∙ 01/13/2018

An Explicit Convergence Rate for Nesterov's Method from SDP

The framework of Integral Quadratic Constraints (IQC) introduced by Less...

0 Sam Safavi, et al. ∙

research

∙ 01/12/2018

A Family of Tractable Graph Distances

Important data mining problems such as nearest-neighbor search and clust...

0 José Bento, et al. ∙

research

∙ 10/02/2017

How is Distributed ADMM Affected by Network Topology?

When solving consensus optimization problems over a graph, there is ofte...

0 Guilherme França, et al. ∙

research

∙ 03/10/2017

Tuning Over-Relaxed ADMM

The framework of Integral Quadratic Constraints (IQC) reduces the comput...

0 Guilherme França, et al. ∙

research

∙ 03/10/2017

Markov Chain Lifting and Distributed ADMM

The time to converge to the steady state of a finite Markov chain can be...

0 Guilherme França, et al. ∙

research

∙ 02/25/2017

Generative Adversarial Active Learning

We propose a new active learning by query synthesis approach using Gener...

0 Jia-Jie Zhu, et al. ∙

research

∙ 03/08/2016

Testing fine-grained parallelism for the ADMM on a factor-graph

There is an ongoing effort to develop tools that apply distributed compu...

0 Ning Hao, et al. ∙

research

∙ 01/12/2016

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

Metrics on the space of sets of trajectories are important for scientist...

0 José Bento, et al. ∙

research

∙ 12/07/2015

An Explicit Rate Bound for the Over-Relaxed ADMM

The framework of Integral Quadratic Constraints of Lessard et al. (2014)...

0 Guilherme França, et al. ∙

research

∙ 05/12/2015

The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning

We describe a new instance-based learning algorithm called the Boundary ...

0 Charles Mathy, et al. ∙

research

∙ 04/07/2015

Proximal operators for multi-agent path planning

We address the problem of planning collision-free paths for multiple age...

0 José Bento, et al. ∙

research

∙ 11/18/2013

A message-passing algorithm for multi-agent trajectory planning

We describe a novel approach for computing collision-free global traject...

0 José Bento, et al. ∙

research

∙ 05/08/2013

An Improved Three-Weight Message-Passing Algorithm

We describe how the powerful "Divide and Concur" algorithm for constrain...

0 Nate Derbinsky, et al. ∙

research

∙ 07/26/2012

Identifying Users From Their Rating Patterns

This paper reports on our analysis of the 2011 CAMRa Challenge dataset (...

0 José Bento, et al. ∙

research

∙ 10/08/2011

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

We consider the problem of learning the structure of Ising models (pairw...

0 José Bento, et al. ∙

research

∙ 03/09/2011

Information Theoretic Limits on Learning Stochastic Differential Equations

Consider the problem of learning the drift coefficient of a stochastic d...

0 José Bento, et al. ∙

research

∙ 10/30/2009

Which graphical models are difficult to learn?

We consider the problem of learning the structure of Ising models (pairw...

0 José Bento, et al. ∙

José Bento

Featured Co-authors