default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOren Mangoubi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j1]Oren Mangoubi, Natesh S. Pillai, Aaron Smith:
Simple conditions for metastability of continuous Markov chains. J. Appl. Probab. 58(1): 83-105 (2021)
Conference and Workshop Papers
- 2024
- [c19]Oren Mangoubi, Nisheeth K. Vishnoi:
Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers. ICLR 2024 - 2023
- [c18]Oren Mangoubi, Nisheeth K. Vishnoi:
Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations. COLT 2023: 1522-1587 - [c17]Oren Mangoubi, Nisheeth K. Vishnoi:
Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk. NeurIPS 2023 - 2022
- [c16]Oren Mangoubi, Yikai Wu, Satyen Kale, Abhradeep Thakurta, Nisheeth K. Vishnoi:
Private Matrix Approximation and Geometry of Unitary Orbits. COLT 2022: 3547-3588 - [c15]Vijay Keswani, Oren Mangoubi, Sushant Sachdeva, Nisheeth K. Vishnoi:
A Convergent and Dimension-Independent Min-Max Optimization Algorithm. ICML 2022: 10939-10973 - [c14]Eric W. Vertina, N. Aaron Deskins, Emily Sutherland, Oren Mangoubi:
Predicting MXene Properties via Machine Learning. ICMLA 2022: 1573-1578 - [c13]Oren Mangoubi, Nisheeth K. Vishnoi:
Sampling from Log-Concave Distributions with Infinity-Distance Guarantees. NeurIPS 2022 - [c12]Oren Mangoubi, Nisheeth K. Vishnoi:
Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion. NeurIPS 2022 - 2021
- [c11]Shijian Li, Oren Mangoubi, Lijie Xu, Tian Guo
:
Sync-Switch: Hybrid Parameter Synchronization for Distributed Deep Learning. ICDCS 2021: 528-538 - [c10]Xin Zhang, Yanhua Li, Xun Zhou, Oren Mangoubi, Ziming Zhang, Vincent Filardi, Jun Luo:
DAC-ML: Domain Adaptable Continuous Meta-Learning for Urban Dynamics Prediction. ICDM 2021: 906-915 - [c9]Oren Mangoubi, Nisheeth K. Vishnoi:
Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization. STOC 2021: 896-909 - 2019
- [c8]Oren Mangoubi, Aaron Smith:
Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators. AISTATS 2019: 586-595 - [c7]Oren Mangoubi, Nisheeth K. Vishnoi:
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm. COLT 2019: 2259-2293 - [c6]Oren Mangoubi, Nisheeth K. Vishnoi:
Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk. FOCS 2019: 1338-1357 - [c5]Holden Lee, Oren Mangoubi, Nisheeth K. Vishnoi:
Online sampling from log-concave distributions. NeurIPS 2019: 1226-1237 - 2018
- [c4]Oren Mangoubi, Nisheeth K. Vishnoi:
Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing. COLT 2018: 1086-1124 - [c3]Oren Mangoubi, Nisheeth K. Vishnoi:
Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo. NeurIPS 2018: 6030-6040 - 2013
- [c2]Oren Mangoubi, Shaoshuai Mou, Ji Liu, A. Stephen Morse:
Towards optimal convex combination rules for gossiping. ACC 2013: 1261-1265 - 2011
- [c1]Edwin A. Marengo, Oren Mangoubi:
Compressive through-focus wavefield imaging. Computational Imaging 2011: 787315
Informal and Other Publications
- 2024
- [i17]Peiyao Lai, Oren Mangoubi:
Singular Subspace Perturbation Bounds via Rectangular Random Matrix Diffusions. CoRR abs/2406.02502 (2024) - [i16]Oren Mangoubi, Nisheeth K. Vishnoi:
Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers. CoRR abs/2409.04320 (2024) - 2023
- [i15]Oren Mangoubi, Nisheeth K. Vishnoi:
Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations. CoRR abs/2306.16648 (2023) - 2022
- [i14]Oren Mangoubi, Nisheeth K. Vishnoi:
Faster Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk. CoRR abs/2206.09384 (2022) - [i13]Oren Mangoubi, Yikai Wu, Satyen Kale, Abhradeep Guha Thakurta, Nisheeth K. Vishnoi:
Private Matrix Approximation and Geometry of Unitary Orbits. CoRR abs/2207.02794 (2022) - [i12]Oren Mangoubi, Nisheeth K. Vishnoi:
Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion. CoRR abs/2211.06418 (2022) - 2021
- [i11]Shijian Li, Oren Mangoubi, Lijie Xu, Tian Guo:
Sync-Switch: Hybrid Parameter Synchronization for Distributed Deep Learning. CoRR abs/2104.08364 (2021) - [i10]Oren Mangoubi, Nisheeth K. Vishnoi:
Sampling from Log-Concave Distributions with Infinity-Distance Guarantees and Applications to Differentially Private Optimization. CoRR abs/2111.04089 (2021) - 2020
- [i9]Oren Mangoubi, Nisheeth K. Vishnoi:
A Second-order Equilibrium in Nonconvex-Nonconcave Min-max Optimization: Existence and Algorithm. CoRR abs/2006.12363 (2020) - [i8]Oren Mangoubi, Sushant Sachdeva, Nisheeth K. Vishnoi:
A Provably Convergent and Practical Algorithm for Min-max Optimization with Applications to GANs. CoRR abs/2006.12376 (2020) - 2019
- [i7]Holden Lee, Oren Mangoubi, Nisheeth K. Vishnoi:
Online Sampling from Log-Concave Distributions. CoRR abs/1902.08179 (2019) - [i6]Oren Mangoubi, Nisheeth K. Vishnoi:
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm. CoRR abs/1902.08452 (2019) - [i5]Oren Mangoubi, Nisheeth K. Vishnoi:
Faster algorithms for polytope rounding, sampling, and volume computation via a sublinear "Ball Walk". CoRR abs/1905.01745 (2019) - 2018
- [i4]Oren Mangoubi, Nisheeth K. Vishnoi:
Dimensionally Tight Running Time Bounds for Second-Order Hamiltonian Monte Carlo. CoRR abs/1802.08898 (2018) - [i3]Oren Mangoubi, Natesh S. Pillai, Aaron Smith:
Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities? CoRR abs/1808.03230 (2018) - 2017
- [i2]Oren Mangoubi, Nisheeth K. Vishnoi:
Convex Optimization with Nonconvex Oracles. CoRR abs/1711.02621 (2017) - 2016
- [i1]Oren Mangoubi, Aaron Smith:
Rapid Mixing of Geodesic Walks on Manifolds with Positive Curvature. CoRR abs/1609.02901 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
