Roberto Oliveira

Orcid: 0000-0002-1064-3398

Affiliations:
  • IMPA, Rio de Janeiro, Brazil
  • IBM T.J. Watson Research Center, Yorktown Heights, NY, USA (2004 - 2006)
  • New York University, Department of Mathematics, NY, USA (PhD 2004)


According to our database1, Roberto Oliveira authored at least 29 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Geometric planted matchings beyond the Gaussian model.
CoRR, 2024

2023
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso.
Math. Program., May, 2023

Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints.
Math. Program., May, 2023

Deep Hashing via Householder Quantization.
CoRR, 2023

On the quality of randomized approximations of Tukey's depth.
CoRR, 2023

AmnioML: Amniotic Fluid Segmentation and Volume Prediction with Uncertainty Quantification.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Subtractive random forests.
CoRR, 2022

ExactBoost: Directly Boosting the Margin in Combinatorial and Non-decomposable Metrics.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2019
Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities.
SIAM J. Optim., 2019

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Estimating graph parameters via random walks with restarts.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Extragradient Method with Variance Reduction for Stochastic Variational Inequalities.
SIAM J. Optim., 2017

Local optima of the Sherrington-Kirkpatrick Hamiltonian.
CoRR, 2017

Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Applying root-finding techniques to extend Quantized-State-Systems-based solvers.
Proceedings of the XLII Latin American Computing Conference, 2016

2015
Stochastic Processes With Random Contexts: A Characterization and Adaptive Estimators for the Transition Probabilities.
IEEE Trans. Inf. Theory, 2015

Exceptional rotations of random graphs: a VC theory.
J. Mach. Learn. Res., 2015

2013
The lower tail of random quadratic forms, with applications to ordinary least squares and restricted eigenvalue properties.
CoRR, 2013

2011
Rumor Spreading on Percolation Graphs
CoRR, 2011

2009
The onset of dominance in balls-in-bins processes with feedback.
Random Struct. Algorithms, 2009

2008
The complexity of quantum spin systems on a two-dimensional square lattice.
Quantum Inf. Comput., 2008

The complexity of stoquastic local Hamiltonian problems.
Quantum Inf. Comput., 2008

Balls-in-Bins Processes with Feedback and Brownian Motion.
Comb. Probab. Comput., 2008

2006
Predicting Conditional Quantiles via Reduction to Classification.
Proceedings of the UAI '06, 2006

2005
Connectivity Transitions in Networks with Super-Linear Preferential Attachment.
Internet Math., 2005

On the Generic Insecurity of the Full Domain Hash.
Proceedings of the Advances in Cryptology, 2005

2004
A Scaling Result for Explosive Processes.
Electron. J. Comb., 2004

Improved Randomness Extraction from Two Independent Sources.
Proceedings of the Approximation, 2004

2003
On Extracting Private Randomness over a Public Channel.
Proceedings of the Approximation, 2003


  Loading...