Oren Mangoubi

According to our database, Oren Mangoubi authored at least 28 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk.

Oren Mangoubi, Nisheeth K. Vishnoi

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.

Oren Mangoubi, Nisheeth K. Vishnoi

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.

Oren Mangoubi, Nisheeth K. Vishnoi

CoRR, 2022

Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion.

Oren Mangoubi, Nisheeth K. Vishnoi

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.

Oren Mangoubi, Nisheeth K. Vishnoi

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.

Eric W. Vertina, N. Aaron Deskins, Emily Sutherland, Oren Mangoubi

Proceedings of the 21st IEEE International Conference on Machine Learning and Applications, 2022

A Convergent and Dimension-Independent Min-Max Optimization Algorithm.

Vijay Keswani, Oren Mangoubi, Sushant Sachdeva, Nisheeth K. Vishnoi

Proceedings of the International Conference on Machine Learning, 2022

Private Matrix Approximation and Geometry of Unitary Orbits.

Oren Mangoubi, Yikai Wu, Satyen Kale, Abhradeep Thakurta, Nisheeth K. Vishnoi

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Simple conditions for metastability of continuous Markov chains.

Oren Mangoubi, Natesh S. Pillai, Aaron Smith

J. Appl. Probab., 2021

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

Oren Mangoubi, Nisheeth K. Vishnoi

CoRR, 2021

Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization.

Oren Mangoubi, Nisheeth K. Vishnoi

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.

Xin Zhang, Yanhua Li, Xun Zhou, Oren Mangoubi, Ziming Zhang, Vincent Filardi, Jun Luo

Proceedings of the IEEE International Conference on Data Mining, 2021

Sync-Switch: Hybrid Parameter Synchronization for Distributed Deep Learning.

Shijian Li, Oren Mangoubi, Lijie Xu, Tian Guo

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.

Oren Mangoubi, Sushant Sachdeva, Nisheeth K. Vishnoi

CoRR, 2020

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

Oren Mangoubi, Nisheeth K. Vishnoi

CoRR, 2020

2019

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

Oren Mangoubi, Nisheeth K. Vishnoi

CoRR, 2019

Online sampling from log-concave distributions.

Holden Lee, Oren Mangoubi, Nisheeth K. Vishnoi

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.

Oren Mangoubi, Nisheeth K. Vishnoi

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Nonconvex sampling with the Metropolis-adjusted Langevin algorithm.

Oren Mangoubi, Nisheeth K. Vishnoi

Proceedings of the Conference on Learning Theory, 2019

Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators.

Oren Mangoubi, Aaron Smith

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?

Oren Mangoubi, Natesh S. Pillai, Aaron Smith

CoRR, 2018

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

Oren Mangoubi, Nisheeth K. Vishnoi

CoRR, 2018

Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo.

Oren Mangoubi, Nisheeth K. Vishnoi

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.

Oren Mangoubi, Nisheeth K. Vishnoi

Proceedings of the Conference On Learning Theory, 2018

2017

Convex Optimization with Nonconvex Oracles.

Oren Mangoubi, Nisheeth K. Vishnoi

CoRR, 2017

2016

Rapid Mixing of Geodesic Walks on Manifolds with Positive Curvature.

Oren Mangoubi, Aaron Smith

CoRR, 2016

2013

Towards optimal convex combination rules for gossiping.

Oren Mangoubi, Shaoshuai Mou, Ji Liu, A. Stephen Morse

Proceedings of the American Control Conference, 2013

2011

Compressive through-focus wavefield imaging.

Edwin A. Marengo, Oren Mangoubi

Proceedings of the Computational Imaging IX, 2011