Oren Mangoubi

According to our database1, Oren Mangoubi authored at least 30 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions.
CoRR, 2024

Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Faster Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk.
CoRR, 2022

Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Sampling from Log-Concave Distributions with Infinity-Distance Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Predicting MXene Properties via Machine Learning.
Proceedings of the 21st IEEE International Conference on Machine Learning and Applications, 2022

A Convergent and Dimension-Independent Min-Max Optimization Algorithm.
Proceedings of the International Conference on Machine Learning, 2022

Private Matrix Approximation and Geometry of Unitary Orbits.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Simple conditions for metastability of continuous Markov chains.
J. Appl. Probab., 2021

Sampling from Log-Concave Distributions with Infinity-Distance Guarantees and Applications to Differentially Private Optimization.
CoRR, 2021

Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

DAC-ML: Domain Adaptable Continuous Meta-Learning for Urban Dynamics Prediction.
Proceedings of the IEEE International Conference on Data Mining, 2021

Sync-Switch: Hybrid Parameter Synchronization for Distributed Deep Learning.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
A Provably Convergent and Practical Algorithm for Min-max Optimization with Applications to GANs.
CoRR, 2020

A Second-order Equilibrium in Nonconvex-Nonconcave Min-max Optimization: Existence and Algorithm.
CoRR, 2020

2019
Faster algorithms for polytope rounding, sampling, and volume computation via a sublinear "Ball Walk".
CoRR, 2019

Online sampling from log-concave distributions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Nonconvex sampling with the Metropolis-adjusted Langevin algorithm.
Proceedings of the Conference on Learning Theory, 2019

Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?
CoRR, 2018

Dimensionally Tight Running Time Bounds for Second-Order Hamiltonian Monte Carlo.
CoRR, 2018

Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing.
Proceedings of the Conference On Learning Theory, 2018

2017
Convex Optimization with Nonconvex Oracles.
CoRR, 2017

2016
Rapid Mixing of Geodesic Walks on Manifolds with Positive Curvature.
CoRR, 2016

2013
Towards optimal convex combination rules for gossiping.
Proceedings of the American Control Conference, 2013

2011
Compressive through-focus wavefield imaging.
Proceedings of the Computational Imaging IX, 2011


  Loading...