default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin J. Wainwright
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j84]Wenlong Mou, Nhat Ho, Martin J. Wainwright
, Peter L. Bartlett, Michael I. Jordan:
A Diffusion Process Perspective on Posterior Contraction Rates for Parameters. SIAM J. Math. Data Sci. 6(2): 553-577 (2024)- [i137]Yaqi Duan, Martin J. Wainwright:
Taming "data-hungry" reinforcement learning? Stability in continuous state-action spaces. CoRR abs/2401.05233 (2024) - [i136]Fathima Zarin Faizal, Asuman E. Ozdaglar, Martin J. Wainwright:
Finite-Sample Guarantees for Best-Response Learning Dynamics in Zero-Sum Matrix Games. CoRR abs/2407.20128 (2024) - [i135]Jia Wan, Sean R. Sinclair, Devavrat Shah, Martin J. Wainwright:
Exploiting Exogenous Structure for Sample-Efficient Reinforcement Learning. CoRR abs/2409.14557 (2024) - [i134]Flora C. Shi, Stephen Bates, Martin J. Wainwright:
Sharp Results for Hypothesis Testing with Risk-Sensitive Agents. CoRR abs/2412.16452 (2024) - 2023
- [j83]Raaz Dwivedi, Chandan Singh, Bin Yu, Martin J. Wainwright:
Revisiting minimum description length complexity in overparameterized models. J. Mach. Learn. Res. 24: 268:1-268:59 (2023) - [j82]Eric Xia, Koulik Khamaru, Martin J. Wainwright, Michael I. Jordan:
Instance-Dependent Confidence and Early Stopping for Reinforcement Learning. J. Mach. Learn. Res. 24: 392:1-392:43 (2023) - [j81]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright:
Optimal Oracle Inequalities for Projected Fixed-Point Equations, with Applications to Policy Evaluation. Math. Oper. Res. 48(4): 2308-2336 (2023) - [c123]Eric Xia, Martin J. Wainwright:
Krylov-Bellman boosting: Super-linear policy evaluation in general state spaces. AISTATS 2023: 9137-9166 - [c122]Yaqi Duan, Martin J. Wainwright:
A finite-sample analysis of multi-step temporal difference estimates. L4DC 2023: 612-624 - [i133]Licong Lin, Koulik Khamaru, Martin J. Wainwright:
Semi-parametric inference based on adaptively collected data. CoRR abs/2303.02534 (2023) - [i132]Reese Pathak, Martin J. Wainwright, Lin Xiao:
Noisy recovery from random linear observations: Sharp minimax rates under elliptical constraints. CoRR abs/2303.12613 (2023) - [i131]Junhui Cai, Ran Chen, Martin J. Wainwright, Linda Zhao:
Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricing. CoRR abs/2309.08634 (2023) - 2022
- [j80]Wenlong Mou, Nicolas Flammarion, Martin J. Wainwright, Peter L. Bartlett:
An Efficient Sampling Algorithm for Non-smooth Composite Potentials. J. Mach. Learn. Res. 23: 233:1-233:50 (2022) - [j79]Cong Ma, Banghua Zhu, Jiantao Jiao, Martin J. Wainwright:
Minimax Off-Policy Evaluation for Multi-Armed Bandits. IEEE Trans. Inf. Theory 68(8): 5314-5339 (2022) - [c121]Chris Junchi Li, Wenlong Mou, Martin J. Wainwright, Michael I. Jordan:
ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm. COLT 2022: 909-981 - [c120]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright, Peter L. Bartlett:
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. COLT 2022: 2060-2061 - [c119]Reese Pathak, Cong Ma, Martin J. Wainwright:
A new similarity measure for covariate shift with applications to nonparametric regression. ICML 2022: 17517-17530 - [c118]Andrea Zanette, Martin J. Wainwright:
Stabilizing Q-learning with Linear Architectures for Provable Efficient Learning. ICML 2022: 25920-25954 - [c117]Andrea Zanette, Martin J. Wainwright:
Bellman Residual Orthogonalization for Offline Reinforcement Learning. NeurIPS 2022 - [i130]Wenlong Mou, Koulik Khamaru, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
Optimal variance-reduced stochastic approximation in Banach spaces. CoRR abs/2201.08518 (2022) - [i129]Koulik Khamaru, Eric Xia, Martin J. Wainwright, Michael I. Jordan:
Instance-Dependent Confidence and Early Stopping for Reinforcement Learning. CoRR abs/2201.08536 (2022) - [i128]Reese Pathak, Cong Ma, Martin J. Wainwright:
A new similarity measure for covariate shift with applications to nonparametric regression. CoRR abs/2202.02837 (2022) - [i127]Andrea Zanette, Martin J. Wainwright:
Bellman Residual Orthogonalization for Offline Reinforcement Learning. CoRR abs/2203.12786 (2022) - [i126]Cong Ma, Reese Pathak, Martin J. Wainwright:
Optimally tackling covariate shift in RKHS-based nonparametric regression. CoRR abs/2205.02986 (2022) - [i125]Andrea Zanette, Martin J. Wainwright:
Stabilizing Q-learning with Linear Architectures for Provably Efficient Learning. CoRR abs/2206.00796 (2022) - [i124]Wenlong Mou, Martin J. Wainwright, Peter L. Bartlett:
Off-policy estimation of linear functionals: Non-asymptotic theory for semi-parametric efficiency. CoRR abs/2209.13075 (2022) - [i123]Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright, Michael I. Jordan:
QuTE: decentralized multiple testing on sensor networks with false discovery rate control. CoRR abs/2210.04334 (2022) - [i122]Eric Xia, Martin J. Wainwright:
Krylov-Bellman boosting: Super-linear policy evaluation in general state spaces. CoRR abs/2210.11377 (2022) - [i121]Yaqi Duan, Martin J. Wainwright:
Policy evaluation from a single path: Multi-step methods, mixing and mis-specification. CoRR abs/2211.03899 (2022) - 2021
- [j78]Wenlong Mou, Yi-An Ma, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm. J. Mach. Learn. Res. 22: 42:1-42:41 (2021) - [j77]Koulik Khamaru, Ashwin Pananjady, Feng Ruan, Martin J. Wainwright, Michael I. Jordan:
Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis. SIAM J. Math. Data Sci. 3(4): 1013-1040 (2021) - [j76]Ashwin Pananjady, Martin J. Wainwright:
Instance-Dependent ℓ∞-Bounds for Policy Evaluation in Tabular Reinforcement Learning. IEEE Trans. Inf. Theory 67(1): 566-585 (2021) - [j75]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness. IEEE Trans. Inf. Theory 67(6): 4162-4184 (2021) - [c116]Andrea Zanette, Martin J. Wainwright, Emma Brunskill:
Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning. NeurIPS 2021: 13626-13640 - [i120]Cong Ma, Banghua Zhu, Jiantao Jiao, Martin J. Wainwright:
Minimax Off-Policy Evaluation for Multi-Armed Bandits. CoRR abs/2101.07781 (2021) - [i119]Kush Bhatia, Ashwin Pananjady, Peter L. Bartlett, Anca D. Dragan, Martin J. Wainwright:
Preference learning along multiple criteria: A game-theoretic perspective. CoRR abs/2105.01850 (2021) - [i118]Koulik Khamaru, Eric Xia, Martin J. Wainwright, Michael I. Jordan:
Instance-optimality in optimal value estimation: Adaptivity via variance-reduced Q-learning. CoRR abs/2106.14352 (2021) - [i117]Koulik Khamaru, Yash Deshpande, Lester Mackey, Martin J. Wainwright:
Near-optimal inference in adaptive linear regression. CoRR abs/2107.02266 (2021) - [i116]Andrea Zanette, Martin J. Wainwright, Emma Brunskill:
Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning. CoRR abs/2108.08812 (2021) - [i115]Yaqi Duan, Mengdi Wang, Martin J. Wainwright:
Optimal policy evaluation using kernel-based temporal difference methods. CoRR abs/2109.12002 (2021) - [i114]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright, Peter L. Bartlett:
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. CoRR abs/2112.12770 (2021) - 2020
- [j74]Dhruv Malik, Ashwin Pananjady, Kush Bhatia, Koulik Khamaru, Peter L. Bartlett, Martin J. Wainwright:
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems. J. Mach. Learn. Res. 21: 21:1-21:51 (2020) - [j73]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients. J. Mach. Learn. Res. 21: 92:1-92:72 (2020) - [j72]Yuting Wei, Martin J. Wainwright:
The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths. IEEE Trans. Inf. Theory 66(8): 5110-5129 (2020) - [c115]Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Martin J. Wainwright, Michael I. Jordan, Bin Yu:
Sharp Analysis of Expectation-Maximization for Weakly Identifiable Models. AISTATS 2020: 1866-1876 - [c114]Wenlong Mou, Chris Junchi Li, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentration. COLT 2020: 2947-2997 - [c113]Kush Bhatia, Ashwin Pananjady, Peter L. Bartlett, Anca D. Dragan, Martin J. Wainwright:
Preference learning along multiple criteria: A game-theoretic perspective. NeurIPS 2020 - [c112]Reese Pathak, Martin J. Wainwright:
FedSplit: an algorithmic framework for fast federated optimization. NeurIPS 2020 - [c111]Jianbo Chen, Michael I. Jordan, Martin J. Wainwright:
HopSkipJumpAttack: A Query-Efficient Decision-Based Attack. SP 2020: 1277-1294 - [i113]Koulik Khamaru, Ashwin Pananjady, Feng Ruan, Martin J. Wainwright, Michael I. Jordan:
Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis. CoRR abs/2003.07337 (2020) - [i112]Wenlong Mou, Chris Junchi Li, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
On Linear Stochastic Approximation: Fine-grained Polyak-Ruppert and Non-Asymptotic Concentration. CoRR abs/2004.04719 (2020) - [i111]Max Rabinovich, Michael I. Jordan, Martin J. Wainwright:
Lower bounds in multiple testing: A framework based on derandomized proxies. CoRR abs/2005.03725 (2020) - [i110]Reese Pathak, Martin J. Wainwright:
FedSplit: An algorithmic framework for fast federated optimization. CoRR abs/2005.05238 (2020) - [i109]Nhat Ho, Koulik Khamaru, Raaz Dwivedi, Martin J. Wainwright, Michael I. Jordan, Bin Yu:
Instability, Computational Efficiency and Statistical Accuracy. CoRR abs/2005.11411 (2020) - [i108]Raaz Dwivedi, Chandan Singh, Bin Yu, Martin J. Wainwright:
Revisiting complexity and the bias-variance tradeoff. CoRR abs/2006.10189 (2020) - [i107]Chris Junchi Li, Wenlong Mou, Martin J. Wainwright, Michael I. Jordan:
ROOT-SGD: Sharp Nonasymptotics and Asymptotic Efficiency in a Single Algorithm. CoRR abs/2008.12690 (2020) - [i106]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright:
Optimal oracle inequalities for solving projected fixed-point equations. CoRR abs/2012.05299 (2020)
2010 – 2019
- 2019
- [j71]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-rank Matrices: Structural Properties and Noisy Completion. J. Mach. Learn. Res. 20: 101:1-101:43 (2019) - [j70]Koulik Khamaru, Martin J. Wainwright:
Convergence Guarantees for a Class of Non-convex and Non-smooth Optimization Problems. J. Mach. Learn. Res. 20: 154:1-154:52 (2019) - [j69]Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu:
Log-concave sampling: Metropolis-Hastings algorithms are fast. J. Mach. Learn. Res. 20: 183:1-183:42 (2019) - [j68]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons. IEEE Trans. Inf. Theory 65(8): 4854-4874 (2019) - [j67]Yuting Wei, Fanny Yang, Martin J. Wainwright:
Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities. IEEE Trans. Inf. Theory 65(10): 6685-6703 (2019) - [c110]Dhruv Malik, Ashwin Pananjady, Kush Bhatia, Koulik Khamaru, Peter L. Bartlett, Martin J. Wainwright:
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems. AISTATS 2019: 2916-2925 - [c109]Jianbo Chen, Le Song, Martin J. Wainwright, Michael I. Jordan:
L-Shapley and C-Shapley: Efficient Model Interpretation for Structured Data. ICLR (Poster) 2019 - [i105]Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Martin J. Wainwright, Michael I. Jordan, Bin Yu:
Challenges with EM in application to weakly identifiable mixture models. CoRR abs/1902.00194 (2019) - [i104]Martin J. Wainwright:
Stochastic approximation with cone-contractive operators: Sharp 𝓁∞-bounds for Q-learning. CoRR abs/1905.06265 (2019) - [i103]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients. CoRR abs/1905.12247 (2019) - [i102]Martin J. Wainwright:
Variance-reduced Q-learning is minimax optimal. CoRR abs/1906.04697 (2019) - [i101]Wenlong Mou, Yi-An Ma, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm. CoRR abs/1908.10859 (2019) - [i100]Ashwin Pananjady, Martin J. Wainwright:
Value function estimation in Markov reward processes: Instance-dependent 𝓁∞-bounds for policy evaluation. CoRR abs/1909.08749 (2019) - [i99]Wenlong Mou, Nicolas Flammarion, Martin J. Wainwright, Peter L. Bartlett:
An Efficient Sampling Algorithm for Non-smooth Composite Potentials. CoRR abs/1910.00551 (2019) - [i98]Wenlong Mou, Nhat Ho, Martin J. Wainwright, Peter L. Bartlett, Michael I. Jordan:
Sampling for Bayesian Mixture Models: MCMC with Polynomial-Time Mixing. CoRR abs/1912.05153 (2019) - 2018
- [j66]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Fast MCMC Sampling Algorithms on Polytopes. J. Mach. Learn. Res. 19: 55:1-55:86 (2018) - [j65]Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery. IEEE Trans. Inf. Theory 64(5): 3286-3300 (2018) - [c108]Reinhard Heckel, Max Simchowitz, Kannan Ramchandran, Martin J. Wainwright:
Approximate ranking from pairwise comparisons. AISTATS 2018: 1057-1066 - [c107]Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, Bin Yu:
Log-concave sampling: Metropolis-Hastings algorithms are fast! COLT 2018: 793-797 - [c106]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time. COLT 2018: 2037-2042 - [c105]Jianbo Chen, Le Song, Martin J. Wainwright, Michael I. Jordan:
Learning to Explain: An Information-Theoretic Perspective on Model Interpretation. ICML 2018: 882-891 - [c104]Koulik Khamaru, Martin J. Wainwright:
Convergence guarantees for a class of non-convex and non-smooth optimization problems. ICML 2018: 2606-2615 - [c103]Aaditya Ramdas, Tijana Zrnic, Martin J. Wainwright, Michael I. Jordan:
SAFFRON: an Adaptive Algorithm for Online Control of the False Discovery Rate. ICML 2018: 4283-4291 - [c102]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-Rank Matrices: Structural Properties and Noisy Completion. ISIT 2018: 366-370 - [c101]Raaz Dwivedi, Nhat Ho, Koulik Khamaru, Martin J. Wainwright, Michael I. Jordan:
Theoretical guarantees for EM under misspecified Gaussian mixture models. NeurIPS 2018: 9704-9712 - [i97]Reinhard Heckel, Max Simchowitz, Kannan Ramchandran, Martin J. Wainwright:
Approximate Ranking from Pairwise Comparisons. CoRR abs/1801.01253 (2018) - [i96]Jianbo Chen, Le Song, Martin J. Wainwright, Michael I. Jordan:
Learning to Explain: An Information-Theoretic Perspective on Model Interpretation. CoRR abs/1802.07814 (2018) - [i95]Aaditya Ramdas, Tijana Zrnic, Martin J. Wainwright, Michael I. Jordan:
SAFFRON: an adaptive algorithm for online control of the false discovery rate. CoRR abs/1802.09098 (2018) - [i94]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Breaking the 1/√n Barrier: Faster Rates for Permutation-based Models in Polynomial Time. CoRR abs/1802.09963 (2018) - [i93]Yuting Wei, Billy Fang, Martin J. Wainwright:
From Gauss to Kolmogorov: Localized Measures of Complexity for Ellipses. CoRR abs/1803.07763 (2018) - [i92]Koulik Khamaru, Martin J. Wainwright:
Convergence guarantees for a class of non-convex and non-smooth optimization problems. CoRR abs/1804.09629 (2018) - [i91]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations. CoRR abs/1806.09544 (2018) - [i90]Jianbo Chen, Le Song, Martin J. Wainwright, Michael I. Jordan:
L-Shapley and C-Shapley: Efficient Model Interpretation for Structured Data. CoRR abs/1808.02610 (2018) - [i89]Dhruv Malik, Ashwin Pananjady, Kush Bhatia, Koulik Khamaru, Peter L. Bartlett, Martin J. Wainwright:
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems. CoRR abs/1812.08305 (2018) - 2017
- [j64]Fanny Yang, Sivaraman Balakrishnan, Martin J. Wainwright:
Statistical and Computational Guarantees for the Baum-Welch Algorithm. J. Mach. Learn. Res. 18: 125:1-125:53 (2017) - [j63]Nihar B. Shah, Martin J. Wainwright:
Simple, Robust and Optimal Ranking from Pairwise Comparisons. J. Mach. Learn. Res. 18: 199:1-199:38 (2017) - [j62]Mert Pilanci, Martin J. Wainwright:
Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence. SIAM J. Optim. 27(1): 205-245 (2017) - [j61]Nihar B. Shah, Sivaraman Balakrishnan, Adityanand Guntuboyina, Martin J. Wainwright:
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues. IEEE Trans. Inf. Theory 63(2): 934-959 (2017) - [c100]Yuchen Zhang, Jason D. Lee, Martin J. Wainwright, Michael I. Jordan:
On the Learnability of Fully-Connected Neural Networks. AISTATS 2017: 83-91 - [c99]Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Vaidya walk: A sampling algorithm based on the volumetric barrier. Allerton 2017: 1220-1227 - [c98]Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright, Michael I. Jordan:
QuTE: Decentralized multiple testing on sensor networks with false discovery rate control. CDC 2017: 6415-6421 - [c97]Yuchen Zhang, Percy Liang, Martin J. Wainwright:
Convexified Convolutional Neural Networks. ICML 2017: 4044-4053 - [c96]Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Denoising linear models with permuted data. ISIT 2017: 446-450 - [c95]Aaditya Ramdas, Fanny Yang, Martin J. Wainwright, Michael I. Jordan:
Online control of the false discovery rate with decaying memory. NIPS 2017: 5650-5659 - [c94]Fanny Yang, Aaditya Ramdas, Kevin G. Jamieson, Martin J. Wainwright:
A framework for Multi-A(rmed)/B(andit) Testing with Online FDR Control. NIPS 2017: 5957-5966 - [c93]Yuting Wei, Fanny Yang, Martin J. Wainwright:
Early stopping for kernel boosting algorithms: A general analysis with localized complexities. NIPS 2017: 6065-6075 - [c92]Jianbo Chen, Mitchell Stern, Martin J. Wainwright, Michael I. Jordan:
Kernel Feature Selection via Conditional Covariance Minimization. NIPS 2017: 6946-6955 - [i88]Yuting Wei, Martin J. Wainwright, Adityanand Guntuboyina:
The geometry of hypothesis testing over convex cones: Generalized likelihood tests and minimax radii. CoRR abs/1703.06810 (2017) - [i87]Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Denoising Linear Models with Permuted Data. CoRR abs/1704.07461 (2017) - [i86]Fanny Yang, Aaditya Ramdas, Kevin G. Jamieson, Martin J. Wainwright:
A framework for Multi-A(rmed)/B(andit) testing with online FDR control. CoRR abs/1706.05378 (2017) - [i85]Jianbo Chen, Mitchell Stern, Martin J. Wainwright, Michael I. Jordan:
Kernel Feature Selection via Conditional Covariance Minimization. CoRR abs/1707.01164 (2017) - [i84]Yuting Wei, Fanny Yang, Martin J. Wainwright:
Early stopping for kernel boosting algorithms: A general analysis with localized complexities. CoRR abs/1707.01543 (2017) - [i83]Ashwin Pananjady, Cheng Mao, Vidya Muthukumar, Martin J. Wainwright, Thomas A. Courtade:
Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons. CoRR abs/1707.06217 (2017) - [i82]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-rank Matrices: Structural Properties and Noisy Completion. CoRR abs/1709.00127 (2017) - [i81]Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright, Michael I. Jordan:
DAGGER: A sequential algorithm for FDR control on DAGs. CoRR abs/1709.10250 (2017) - [i80]Aaditya Ramdas, Fanny Yang, Martin J. Wainwright, Michael I. Jordan:
Online control of the false discovery rate with decaying memory. CoRR abs/1710.00499 (2017) - [i79]Yuting Wei, Martin J. Wainwright:
The local geometry of testing in ellipses: Tight control via localized Kolomogorov widths. CoRR abs/1712.00711 (2017) - 2016
- [j60]Mert Pilanci, Martin J. Wainwright:
Iterative Hessian Sketch: Fast and Accurate Solution Approximation for Constrained Least-Squares. J. Mach. Learn. Res. 17: 53:1-53:38 (2016) - [j59]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. J. Mach. Learn. Res. 17: 58:1-58:47 (2016) - [j58]Michael Chichignoud, Johannes Lederer, Martin J. Wainwright:
A Practical Scheme and Fast Algorithm to Tune the Lasso With Optimality Guarantees. J. Mach. Learn. Res. 17: 231:1-231:20 (2016) - [c91]Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Linear regression with an unknown permutation: Statistical and computational limits. Allerton 2016: 417-424 - [c90]Nihar B. Shah, Sivaraman Balakrishnan, Aditya Guntuboyina, Martin J. Wainwright:
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues. ICML 2016: 11-20 - [c89]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Feeling the bern: Adaptive estimators for Bernoulli probabilities of pairwise comparisons. ISIT 2016: 1153-1157 - [c88]Yuting Wei, Martin J. Wainwright:
Sharp minimax bounds for testing discrete monotone distributions. ISIT 2016: 2684-2688 - [c87]Chi Jin, Yuchen Zhang, Sivaraman Balakrishnan, Martin J. Wainwright, Michael I. Jordan:
Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequences. NIPS 2016: 4116-4124 - [i78]Ahmed El Alaoui, Xiang Cheng, Aaditya Ramdas, Martin J. Wainwright, Michael I. Jordan:
Asymptotic behavior of ℓp-based Laplacian regularization in semi-supervised learning. CoRR abs/1603.00564 (2016) - [i77]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons. CoRR abs/1603.06881 (2016) - [i76]Horia Mania, Aaditya Ramdas, Martin J. Wainwright, Michael I. Jordan, Benjamin Recht:
Universality of Mallows' and degeneracy of Kendall's kernels for rankings. CoRR abs/1603.08035 (2016) - [i75]John C. Duchi, Martin J. Wainwright, Michael I. Jordan:
Minimax Optimal Procedures for Locally Private Estimation. CoRR abs/1604.02390 (2016) - [i74]Maxim Rabinovich, Aaditya Ramdas, Michael I. Jordan, Martin J. Wainwright:
Function-Specific Mixing Times and Concentration Away from Equilibrium. CoRR abs/1605.02077 (2016) - [i73]Reinhard Heckel, Nihar B. Shah, Kannan Ramchandran, Martin J. Wainwright:
Active Ranking from Pairwise Comparisons and the Futility of Parametric Assumptions. CoRR abs/1606.08842 (2016) - [i72]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
A Permutation-based Model for Crowd Labeling: Optimal Estimation and Robustness. CoRR abs/1606.09632 (2016) - [i71]Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Linear Regression with an Unknown Permutation: Statistical and Computational Limits. CoRR abs/1608.02902 (2016) - [i70]Chi Jin, Yuchen Zhang, Sivaraman Balakrishnan, Martin J. Wainwright, Michael I. Jordan:
Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequences. CoRR abs/1609.00978 (2016) - [i69]Yuchen Zhang, Percy Liang, Martin J. Wainwright:
Convexified Convolutional Neural Networks. CoRR abs/1609.01000 (2016) - 2015
- [j57]Po-Ling Loh, Martin J. Wainwright:
Regularized M-estimators with nonconvexity: statistical and algorithmic theory for local optima. J. Mach. Learn. Res. 16: 559-616 (2015) - [j56]Yuchen Zhang, John C. Duchi, Martin J. Wainwright:
Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates. J. Mach. Learn. Res. 16: 3299-3340 (2015) - [j55]Mert Pilanci, Martin J. Wainwright, Laurent El Ghaoui:
Sparse learning via Boolean relaxations. Math. Program. 151(1): 63-87 (2015) - [j54]John C. Duchi, Michael I. Jordan, Martin J. Wainwright, Andre Wibisono:
Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations. IEEE Trans. Inf. Theory 61(5): 2788-2806 (2015) - [j53]Mert Pilanci, Martin J. Wainwright:
Randomized Sketches of Convex Programs With Sharp Guarantees. IEEE Trans. Inf. Theory 61(9): 5096-5115 (2015) - [c86]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. AISTATS 2015 - [c85]Fanny Yang, Sivaraman Balakrishnan, Martin J. Wainwright:
Statistical and computational guarantees for the Baum-Welch algorithm. Allerton 2015: 658-665 - [c84]Yuchen Zhang, Martin J. Wainwright, Michael I. Jordan:
Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds. ICML 2015: 457-465 - [i68]Yun Yang, Mert Pilanci, Martin J. Wainwright:
Randomized sketches for kernels: Fast and optimal non-parametric regression. CoRR abs/1501.06195 (2015) - [i67]Yuchen Zhang, Martin J. Wainwright, Michael I. Jordan:
Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds. CoRR abs/1502.01403 (2015) - [i66]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. CoRR abs/1505.01462 (2015) - [i65]Mert Pilanci, Martin J. Wainwright:
Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergence. CoRR abs/1505.02250 (2015) - [i64]Yun Yang, Martin J. Wainwright, Michael I. Jordan:
On the Computational Complexity of High-Dimensional Bayesian Variable Selection. CoRR abs/1505.07925 (2015) - [i63]Yudong Chen, Martin J. Wainwright:
Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees. CoRR abs/1509.03025 (2015) - [i62]Nihar B. Shah, Sivaraman Balakrishnan, Adityanand Guntuboyina, Martin J. Wainwright:
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues. CoRR abs/1510.05610 (2015) - [i61]Yuchen Zhang, Jason D. Lee, Martin J. Wainwright, Michael I. Jordan:
Learning Halfspaces and Neural Networks with Random Initialization. CoRR abs/1511.07948 (2015) - [i60]Fanny Yang, Sivaraman Balakrishnan, Martin J. Wainwright:
Statistical and Computational Guarantees for the Baum-Welch Algorithm. CoRR abs/1512.08269 (2015) - [i59]Nihar B. Shah, Martin J. Wainwright:
Simple, Robust and Optimal Ranking from Pairwise Comparisons. CoRR abs/1512.08949 (2015) - 2014
- [j52]John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Privacy Aware Learning. J. ACM 61(6): 38:1-38:57 (2014) - [j51]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Early stopping and non-parametric regression: an optimal data-dependent stopping rule. J. Mach. Learn. Res. 15(1): 335-366 (2014) - [c83]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
Stochastic optimization and sparse statistical recovery: An optimal algorithm for high dimensions. CISS 2014: 1-2 - [c82]Yuchen Zhang, Martin J. Wainwright, Michael I. Jordan:
Lower bounds on the performance of polynomial-time algorithms for sparse linear regression. COLT 2014: 921-948 - [c81]Mert Pilanci, Martin J. Wainwright:
Randomized sketches of convex programs with sharp guarantees. ISIT 2014: 921-925 - [i58]Yuchen Zhang, Martin J. Wainwright, Michael I. Jordan:
Lower bounds on the performance of polynomial-time algorithms for sparse linear regression. CoRR abs/1402.1918 (2014) - [i57]Mert Pilanci, Martin J. Wainwright:
Randomized Sketches of Convex Programs with Sharp Guarantees. CoRR abs/1404.7203 (2014) - [i56]John C. Duchi, Michael I. Jordan, Martin J. Wainwright, Yuchen Zhang:
Information-theoretic lower bounds for distributed statistical estimation with communication constraints. CoRR abs/1405.0782 (2014) - [i55]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
When is it Better to Compare than to Score? CoRR abs/1406.6618 (2014) - [i54]Sivaraman Balakrishnan, Martin J. Wainwright, Bin Yu:
Statistical guarantees for the EM algorithm: From population to sample-based analysis. CoRR abs/1408.2156 (2014) - [i53]Mert Pilanci, Martin J. Wainwright:
Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares. CoRR abs/1411.0347 (2014) - [i52]Po-Ling Loh, Martin J. Wainwright:
Support recovery without incoherence: A case for nonconvex regularization. CoRR abs/1412.5632 (2014) - 2013
- [j50]Nima Noorshams, Martin J. Wainwright:
Belief propagation for continuous state spaces: stochastic message-passing with quantitative guarantees. J. Mach. Learn. Res. 14(1): 2799-2835 (2013) - [j49]Yuchen Zhang, John C. Duchi, Martin J. Wainwright:
Communication-efficient algorithms for statistical optimization. J. Mach. Learn. Res. 14(1): 3321-3363 (2013) - [j48]Nima Noorshams, Martin J. Wainwright:
Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm. IEEE Trans. Inf. Theory 59(4): 1981-2000 (2013) - [c80]John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Local privacy and statistical minimax rates. Allerton 2013: 1592 - [c79]Yuchen Zhang, John C. Duchi, Martin J. Wainwright:
Divide and Conquer Kernel Ridge Regression. COLT 2013: 592-617 - [c78]John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Local Privacy and Statistical Minimax Rates. FOCS 2013: 429-438 - [c77]Po-Ling Loh, Martin J. Wainwright:
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima. NIPS 2013: 476-484 - [c76]John C. Duchi, Martin J. Wainwright, Michael I. Jordan:
Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation. NIPS 2013: 1529-1537 - [c75]Yuchen Zhang, John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Information-theoretic lower bounds for distributed statistical estimation with communication constraints. NIPS 2013: 2328-2336 - [i51]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
A New Class of Upper Bounds on the Log Partition Function. CoRR abs/1301.0610 (2013) - [i50]Nima Noorshams, Martin J. Wainwright:
Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging with Noisy Links. CoRR abs/1302.2129 (2013) - [i49]John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Local Privacy and Statistical Minimax Rates. CoRR abs/1302.3203 (2013) - [i48]Po-Ling Loh, Martin J. Wainwright:
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima. CoRR abs/1305.2436 (2013) - [i47]Yuchen Zhang, John C. Duchi, Martin J. Wainwright:
Divide and Conquer Kernel Ridge Regression: A Distributed Algorithm with Minimax Optimal Rates. CoRR abs/1305.5029 (2013) - [i46]John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation. CoRR abs/1305.6000 (2013) - [i45]John C. Duchi, Martin J. Wainwright:
Distance-based and continuum Fano inequalities with applications to statistical estimation. CoRR abs/1311.2669 (2013) - [i44]John C. Duchi, Michael I. Jordan, Martin J. Wainwright, Andre Wibisono:
Optimal rates for zero-order optimization: the power of two function evaluations. CoRR abs/1312.2139 (2013) - 2012
- [j47]Arash A. Amini, Martin J. Wainwright:
Approximation properties of certain operator-induced norms on Hilbert spaces. J. Approx. Theory 164(2): 320-345 (2012) - [j46]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming. J. Mach. Learn. Res. 13: 389-427 (2012) - [j45]Sahand N. Negahban, Martin J. Wainwright:
Restricted Strong Convexity and Weighted Matrix Completion: Optimal Bounds with Noise. J. Mach. Learn. Res. 13: 1665-1697 (2012) - [j44]John C. Duchi, Peter L. Bartlett, Martin J. Wainwright:
Randomized Smoothing for Stochastic Optimization. SIAM J. Optim. 22(2): 674-701 (2012) - [j43]John C. Duchi, Alekh Agarwal, Martin J. Wainwright:
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling. IEEE Trans. Autom. Control. 57(3): 592-606 (2012) - [j42]Alekh Agarwal, Peter L. Bartlett, Pradeep Ravikumar, Martin J. Wainwright:
Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization. IEEE Trans. Inf. Theory 58(5): 3235-3249 (2012) - [j41]Narayana P. Santhanam, Martin J. Wainwright:
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions. IEEE Trans. Inf. Theory 58(7): 4117-4134 (2012) - [c74]John C. Duchi, Alekh Agarwal, Martin J. Wainwright:
Dual averaging for distributed optimization. Allerton Conference 2012: 1564-1565 - [c73]John C. Duchi, Peter L. Bartlett, Martin J. Wainwright:
Randomized smoothing for (parallel) stochastic optimization. CDC 2012: 5442-5444 - [c72]Yuchen Zhang, John C. Duchi, Martin J. Wainwright:
Communication-efficient algorithms for statistical optimization. CDC 2012: 6792 - [c71]Nima Noorshams, Martin J. Wainwright:
Quantized stochastic belief propagation: Efficient message-passing for continuous state spaces. ISIT 2012: 1241-1245 - [c70]Po-Ling Loh, Martin J. Wainwright:
Corrupted and missing predictors: Minimax bounds for high-dimensional linear regression. ISIT 2012: 2601-2605 - [c69]John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Privacy Aware Learning. NIPS 2012: 1439-1447 - [c68]John C. Duchi, Michael I. Jordan, Martin J. Wainwright, Andre Wibisono:
Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods. NIPS 2012: 1448-1456 - [c67]Yuchen Zhang, John C. Duchi, Martin J. Wainwright:
Communication-Efficient Algorithms for Statistical Optimization. NIPS 2012: 1511-1519 - [c66]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
Stochastic optimization and sparse statistical recovery: Optimal algorithms for high dimensions. NIPS 2012: 1547-1555 - [c65]Po-Ling Loh, Martin J. Wainwright:
Structure estimation for discrete graphical models: Generalized covariance matrices and their inverses. NIPS 2012: 2096-2104 - [c64]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
FASt global convergence of gradient methods for solving regularized M-estimation. SSP 2012: 409-412 - [i43]Vladimir Kolmogorov, Martin J. Wainwright:
On the optimality of tree-reweighted max-product message-passing. CoRR abs/1207.1395 (2012) - [i42]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
Stochastic optimization and sparse statistical recovery: An optimal algorithm for high dimensions. CoRR abs/1207.4421 (2012) - [i41]Yuchen Zhang, John C. Duchi, Martin J. Wainwright:
Comunication-Efficient Algorithms for Statistical Optimization. CoRR abs/1209.4129 (2012) - [i40]John C. Duchi, Michael I. Jordan, Martin J. Wainwright:
Privacy Aware Learning. CoRR abs/1210.2085 (2012) - [i39]Martin J. Wainwright:
Discussion: Latent variable graphical model selection via convex optimization. CoRR abs/1211.0808 (2012) - [i38]Nima Noorshams, Martin J. Wainwright:
Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees. CoRR abs/1212.3850 (2012) - 2011
- [j40]Nima Noorshams, Martin J. Wainwright:
Non-Asymptotic Analysis of an Optimal Algorithm for Network-Constrained Averaging With Noisy Links. IEEE J. Sel. Top. Signal Process. 5(4): 833-844 (2011) - [j39]Sahand N. Negahban, Martin J. Wainwright:
Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block 1/ INFINITY -Regularization. IEEE Trans. Inf. Theory 57(6): 3841-3863 (2011) - [j38]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Minimax Rates of Estimation for High-Dimensional Linear Regression Over q -Balls. IEEE Trans. Inf. Theory 57(10): 6976-6994 (2011) - [j37]Ram Rajagopal, Martin J. Wainwright:
Network-Based Consensus Averaging With General Noisy Channels. IEEE Trans. Signal Process. 59(1): 373-385 (2011) - [c63]Nima Noorshams, Martin J. Wainwright:
Stochastic belief propagation: Low-complexity message-passing with guarantees. Allerton 2011: 269-276 - [c62]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Early stopping for non-parametric regression: An optimal data-dependent stopping rule. Allerton 2011: 1318-1325 - [c61]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions. ICML 2011: 1129-1136 - [c60]Miles Lopes, Laurent Jacob, Martin J. Wainwright:
A More Powerful Two-Sample Test in High Dimensions using Random Projection. NIPS 2011: 1206-1214 - [c59]Po-Ling Loh, Martin J. Wainwright:
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity. NIPS 2011: 2726-2734 - [i37]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions. CoRR abs/1102.4807 (2011) - [i36]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
Fast global convergence of gradient methods for high-dimensional statistical recovery. CoRR abs/1104.4824 (2011) - [i35]Po-Ling Loh, Martin J. Wainwright:
High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity. CoRR abs/1109.3714 (2011) - [i34]Nima Noorshams, Martin J. Wainwright:
Stochastic Belief Propagation: Low-Complexity Message-Passing with Guarantees. CoRR abs/1111.1020 (2011) - 2010
- [j36]Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwright:
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes. J. Mach. Learn. Res. 11: 1043-1080 (2010) - [j35]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Restricted Eigenvalue Properties for Correlated Gaussian Designs. J. Mach. Learn. Res. 11: 2241-2259 (2010) - [j34]Dapo Omidiran, Martin J. Wainwright:
High-dimensional Variable Selection with Sparse Random Projections: Measurement Sparsity and Statistical Efficiency. J. Mach. Learn. Res. 11: 2361-2386 (2010) - [j33]Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, Borivoje Nikolic:
An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors. IEEE J. Solid State Circuits 45(4): 843-855 (2010) - [j32]Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, Borivoje Nikolic:
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. IEEE Trans. Inf. Theory 56(1): 181-201 (2010) - [j31]Martin J. Wainwright, Elitza N. Maneva, Emin Martinian:
Lossy source compression using low-density generator matrix codes: analysis and algorithms. IEEE Trans. Inf. Theory 56(3): 1351-1368 (2010) - [j30]Wei Wang, Martin J. Wainwright, Kannan Ramchandran:
Information-theoretic limits on sparse signal recovery: dense versus sparse measurement matrices. IEEE Trans. Inf. Theory 56(6): 2967-2979 (2010) - [j29]Alexandros G. Dimakis, Brighten Godfrey, Yunnan Wu, Martin J. Wainwright, Kannan Ramchandran:
Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9): 4539-4551 (2010) - [j28]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization. IEEE Trans. Inf. Theory 56(11): 5847-5861 (2010) - [c58]Nima Noorshams, Martin J. Wainwright:
Lossy source coding with sparse graph codes: A variational formulation of soft decimation. Allerton 2010: 354-360 - [c57]Sahand N. Negahban, Martin J. Wainwright:
Estimation of (near) low-rank matrices with noise and high-dimensional scaling. ICML 2010: 823-830 - [c56]Wei Wang, Martin J. Wainwright, Kannan Ramchandran:
Information-theoretic bounds on model selection for Gaussian Markov random fields. ISIT 2010: 1373-1377 - [c55]Nima Noorshams, Martin J. Wainwright:
A near-optimal algorithm for network-constrained averaging with noisy links. ISIT 2010: 1768-1772 - [c54]Alekh Agarwal, Sahand N. Negahban, Martin J. Wainwright:
Fast global convergence rates of gradient methods for high-dimensional statistical recovery. NIPS 2010: 37-45 - [c53]John C. Duchi, Alekh Agarwal, Martin J. Wainwright:
Distributed Dual Averaging In Networks. NIPS 2010: 550-558 - [i33]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Minimax-optimal rates for sparse additive models over kernel classes via convex programming. CoRR abs/1008.3654 (2010) - [i32]Alekh Agarwal, Peter L. Bartlett, Pradeep Ravikumar, Martin J. Wainwright:
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization. CoRR abs/1009.0571 (2010) - [i31]Sahand N. Negahban, Martin J. Wainwright:
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. CoRR abs/1009.2118 (2010) - [i30]Sahand N. Negahban, Pradeep Ravikumar, Martin J. Wainwright, Bin Yu:
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers. CoRR abs/1010.2731 (2010)
2000 – 2009
- 2009
- [j27]Lara Dolecek, Pamela Lee, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, Martin J. Wainwright:
Predicting error floors of structured LDPC codes: deterministic bounds and estimates. IEEE J. Sel. Areas Commun. 27(6): 908-917 (2009) - [j26]Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin J. Wainwright:
Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices. IEEE Trans. Commun. 57(11): 3258-3268 (2009) - [j25]Martin J. Wainwright, Emin Martinian:
Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information. IEEE Trans. Inf. Theory 55(3): 1061-1079 (2009) - [j24]Martin J. Wainwright:
Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso). IEEE Trans. Inf. Theory 55(5): 2183-2202 (2009) - [j23]Alexandros G. Dimakis, Amin A. Gohari, Martin J. Wainwright:
Guessing facets: polytope structure and improved LP decoder. IEEE Trans. Inf. Theory 55(8): 3479-3487 (2009) - [j22]Martin J. Wainwright:
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting. IEEE Trans. Inf. Theory 55(12): 5728-5741 (2009) - [c52]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Minimax rates of convergence for high-dimensional regression under ℓq-ball sparsity. Allerton 2009: 251-257 - [c51]Alekh Agarwal, Peter L. Bartlett, Pradeep Ravikumar, Martin J. Wainwright:
Information-theoretic lower bounds on the oracle complexity of convex optimization. NIPS 2009: 1-9 - [c50]Sahand N. Negahban, Pradeep Ravikumar, Martin J. Wainwright, Bin Yu:
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers. NIPS 2009: 1348-1356 - [c49]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Lower bounds on minimax rates for nonparametric regression with additive sparsity and smoothness. NIPS 2009: 1563-1570 - [i29]Sahand N. Negahban, Martin J. Wainwright:
Simultaneous support recovery in high dimensions: Benefits and perils of block l1/linfinity-regularization. CoRR abs/0905.0642 (2009) - [i28]Narayana P. Santhanam, Martin J. Wainwright:
Information-theoretic limits of selecting binary graphical models in high dimensions. CoRR abs/0905.2639 (2009) - [i27]Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Minimax rates of estimation for high-dimensional linear regression over $\ell_q$-balls. CoRR abs/0910.2042 (2009) - 2008
- [j21]Martin J. Wainwright, Michael I. Jordan:
Graphical Models, Exponential Families, and Variational Inference. Found. Trends Mach. Learn. 1(1-2): 1-305 (2008) - [j20]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection. IEEE Trans. Inf. Theory 54(7): 3285-3295 (2008) - [j19]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic Analysis of Linear Programming Decoding. IEEE Trans. Inf. Theory 54(8): 3565-3578 (2008) - [j18]Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright:
Geographic Gossip: Efficient Averaging for Sensor Networks. IEEE Trans. Signal Process. 56(3): 1205-1216 (2008) - [j17]Tanya G. Roosta, Martin J. Wainwright, Shankar S. Sastry:
Convergence Analysis of Reweighted Sum-Product Algorithms. IEEE Trans. Signal Process. 56(9): 4293-4305 (2008) - [c48]Guillaume Obozinski, Martin J. Wainwright, Michael I. Jordan:
Union support recovery in high-dimensional multivariate regression. Allerton 2008: 21-26 - [c47]Martin J. Wainwright:
Spectral clustering in high-dimensions: Necessary and sufficient conditions for dense and sparse mixtures. Allerton 2008: 191 - [c46]Narayana Santhanam, Martin J. Wainwright:
Sample complexity of determining structures of graphical models. Allerton 2008: 1232-1237 - [c45]Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin J. Wainwright:
Lowering LDPC Error Floors by Postprocessing. GLOBECOM 2008: 3074-3079 - [c44]Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwright:
Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes. ICML 2008: 800-807 - [c43]Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, Martin J. Wainwright:
Error floors in LDPC codes: Fast simulation, bounds and hardware emulation. ISIT 2008: 444-448 - [c42]Narayana P. Santhanam, Martin J. Wainwright:
Information-theoretic limits of graphical model selection in high dimensions. ISIT 2008: 2136-2140 - [c41]Dapo Omidiran, Martin J. Wainwright:
High-dimensional subset recovery in noise: Sparse measurements and statistical efficiency. ISIT 2008: 2192-2196 - [c40]Wei Wang, Martin J. Wainwright, Kannan Ramchandran:
Information-theoretic limits on sparse support recovery: Dense versus sparse measurements. ISIT 2008: 2197-2201 - [c39]Arash A. Amini, Martin J. Wainwright:
High-dimensional analysis of semidefinite relaxations for sparse principal components. ISIT 2008: 2454-2458 - [c38]Sahand N. Negahban, Martin J. Wainwright:
Phase transitions for high-dimensional joint support recovery. NIPS 2008: 1161-1168 - [c37]Guillaume Obozinski, Martin J. Wainwright, Michael I. Jordan:
High-dimensional support union recovery in multivariate regression. NIPS 2008: 1217-1224 - [c36]Pradeep Ravikumar, Garvesh Raskutti, Martin J. Wainwright, Bin Yu:
Model Selection in Gaussian Graphical Models: High-Dimensional Consistency of l1-regularized MLE. NIPS 2008: 1329-1336 - [i26]Alexandros G. Dimakis, Brighten Godfrey, Yunnan Wu, Martin J. Wainwright, Kannan Ramchandran:
Network Coding for Distributed Storage Systems. CoRR abs/0803.0632 (2008) - [i25]Arash A. Amini, Martin J. Wainwright:
High-dimensional analysis of semidefinite relaxations for sparse principal components. CoRR abs/0803.4026 (2008) - [i24]Ram Rajagopal, Martin J. Wainwright:
Network-based consensus averaging with general noisy channels. CoRR abs/0805.0438 (2008) - [i23]Dapo Omidiran, Martin J. Wainwright:
High-dimensional subset recovery in noise: Sparsified measurements without loss of statistical efficiency. CoRR abs/0805.3005 (2008) - [i22]Wei Wang, Martin J. Wainwright, Kannan Ramchandran:
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices. CoRR abs/0806.0604 (2008) - [i21]Alexandros G. Dimakis, Martin J. Wainwright, Kannan Ramchandran:
Lower Bounds on the Rate-Distortion Function of LDGM Codes. CoRR abs/0808.2073 (2008) - [i20]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
Estimating divergence functionals and the likelihood ratio by convex risk minimization. CoRR abs/0809.0853 (2008) - 2007
- [j16]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A new look at survey propagation and its generalizations. J. ACM 54(4): 17 (2007) - [j15]Martin J. Wainwright:
Sparse Graph Codes for Side Information and Binning. IEEE Signal Process. Mag. 24(5): 47-57 (2007) - [j14]Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright:
LP Decoding Corrects a Constant Fraction of Errors. IEEE Trans. Inf. Theory 53(1): 82-89 (2007) - [c35]Tanya G. Roosta, Martin J. Wainwright, Shankar Sastry:
Convergence Analysis of Reweighted Sum-Product Algorithms. ICASSP (2) 2007: 541-544 - [c34]Zhengya Zhang, Lara Dolecek, Martin J. Wainwright, Venkat Anantharam, Borivoje Nikolic:
Quantization Effects in Low-Density Parity-Check Decoders. ICC 2007: 6231-6237 - [c33]Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Martin J. Wainwright, Borivoje Nikolic:
Analysis of Absorbing Sets for Array-Based LDPC Codes. ICC 2007: 6261-6268 - [c32]Alexandros G. Dimakis, Brighten Godfrey, Martin J. Wainwright, Kannan Ramchandran:
Network Coding for Distributed Storage Systems. INFOCOM 2007: 2000-2008 - [c31]Jeremy Schiff, Dominic Antonelli, Alexandros G. Dimakis, David Chu, Martin J. Wainwright:
Robust message-passing for statistical inference in sensor networks. IPSN 2007: 109-118 - [c30]Martin J. Wainwright:
Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting. ISIT 2007: 961-965 - [c29]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
Nonparametric estimation of the likelihood ratio and divergence functionals. ISIT 2007: 2016-2020 - [c28]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
Estimating divergence functionals and the likelihood ratio by penalized convex risk minimization. NIPS 2007: 1089-1096 - [c27]Erik B. Sudderth, Martin J. Wainwright, Alan S. Willsky:
Loop Series and Bethe Variational Bounds in Attractive Graphical Models. NIPS 2007: 1425-1432 - [c26]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic analysis of linear programming decoding. SODA 2007: 385-394 - [i19]Martin J. Wainwright, Emin Martinian:
Low-density graph codes that are optimal for source/channel coding and binning. CoRR abs/0704.1818 (2007) - [i18]Ram Rajagopal, Martin J. Wainwright:
Universal Quantile Estimation with Feedback in the Communication-Constrained Setting. CoRR abs/0706.0720 (2007) - [i17]Alexandros G. Dimakis, Amin A. Gohari, Martin J. Wainwright:
Guessing Facets: Polytope Structure and Improved LP Decoding. CoRR abs/0709.3915 (2007) - [i16]Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright:
Geographic Gossip: Efficient Averaging for Sensor Networks. CoRR abs/0709.3921 (2007) - [i15]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic Analysis of Linear Programming Decoding. CoRR abs/cs/0702014 (2007) - [i14]Alexandros G. Dimakis, Brighten Godfrey, Martin J. Wainwright, Kannan Ramchandran:
Network Coding for Distributed Storage Systems. CoRR abs/cs/0702015 (2007) - [i13]Martin J. Wainwright:
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting. CoRR abs/math/0702301 (2007) - 2006
- [j13]Martin J. Wainwright:
Estimating the "Wrong" Graphical Model: Benefits in the Computation-Limited Setting. J. Mach. Learn. Res. 7: 1829-1859 (2006) - [j12]Lei Chen, Martin J. Wainwright, Müjdat Çetin, Alan S. Willsky:
Data association based on optimization in graphical models with application to sensor networks. Math. Comput. Model. 43(9-10): 1114-1135 (2006) - [j11]Müjdat Çetin, Lei Chen, John W. Fisher III, Alexander T. Ihler, Randolph L. Moses, Martin J. Wainwright, Alan S. Willsky:
Distributed fusion in sensor networks. IEEE Signal Process. Mag. 23(4): 42-55 (2006) - [j10]Martin J. Wainwright, Michael I. Jordan:
Log-determinant relaxation for approximate inference in discrete Markov random fields. IEEE Trans. Signal Process. 54(6-1): 2099-2109 (2006) - [c25]Emin Martinian, Martin J. Wainwright:
Low Density Codes Achieve theRate-Distortion Bound. DCC 2006: 153-162 - [c24]Zhengya Zhang, Lara Dolecek, Borivoje Nikolic, Venkat Anantharam, Martin J. Wainwright:
Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation. GLOBECOM 2006 - [c23]Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright:
Geographic gossip: efficient aggregation for sensor networks. IPSN 2006: 69-76 - [c22]Emin Martinian, Martin J. Wainwright:
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds. ISIT 2006: 484-488 - [c21]Ram Rajagopal, Martin J. Wainwright, Pravin Varaiya:
Universal Quantile Estimation with Feedback in the Communication-Constrained Setting. ISIT 2006: 836-840 - [c20]Alexandros G. Dimakis, Martin J. Wainwright:
Guessing Facets: Polytope Structure and Improved LP Decoder. ISIT 2006: 1369-1373 - [c19]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
On optimal quantization rules for sequential decision problems. ISIT 2006: 2652-2656 - [c18]Emin Martinian, Martin J. Wainwright:
Low-density constructions for lossy compression, binning, and coding with side information. ITW 2006: 263-264 - [c17]Martin J. Wainwright, Pradeep Ravikumar, John D. Lafferty:
High-Dimensional Graphical Model Selection Using ℓ1-Regularized Logistic Regression. NIPS 2006: 1465-1472 - [i12]Emin Martinian, Martin J. Wainwright:
Low density codes achieve the rate-distortion bound. CoRR abs/cs/0601123 (2006) - [i11]Emin Martinian, Martin J. Wainwright:
Analysis of LDGM and compound codes for lossy compression and binning. CoRR abs/cs/0602046 (2006) - [i10]Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright:
Geographic Gossip: Efficient Aggregation for Sensor Networks. CoRR abs/cs/0602071 (2006) - [i9]Martin J. Wainwright:
Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting. CoRR abs/cs/0602092 (2006) - [i8]Emin Martinian, Martin J. Wainwright:
Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds. CoRR abs/cs/0605091 (2006) - [i7]Alexandros G. Dimakis, Martin J. Wainwright:
Guessing Facets: Polytope Structure and Improved LP Decoder. CoRR abs/cs/0608029 (2006) - [i6]Martin J. Wainwright:
Sharp thresholds for high-dimensional and noisy recovery of sparsity. CoRR abs/math/0605740 (2006) - [i5]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
On optimal quantization rules for some sequential decision problems. CoRR abs/math/0608556 (2006) - 2005
- [j9]Jon Feldman, Martin J. Wainwright, David R. Karger:
Using linear programming to Decode Binary linear codes. IEEE Trans. Inf. Theory 51(3): 954-972 (2005) - [j8]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
A new class of upper bounds on the log partition function. IEEE Trans. Inf. Theory 51(7): 2313-2335 (2005) - [j7]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
MAP estimation via agreement on trees: message-passing and linear programming. IEEE Trans. Inf. Theory 51(11): 3697-3717 (2005) - [j6]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
Nonparametric decentralized detection using kernel methods. IEEE Trans. Signal Process. 53(11): 4053-4066 (2005) - [c16]Martin J. Wainwright, Elitza N. Maneva:
Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes. ISIT 2005: 1493-1497 - [c15]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
Divergences, surrogate loss functions and experimental design. NIPS 2005: 1011-1018 - [c14]Martin J. Wainwright:
Estimating the wrong Markov random field: Benefits in the computation-limited setting. NIPS 2005: 1425-1432 - [c13]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A new look at survey propagation and its generalizations. SODA 2005: 1089-1098 - [c12]Vladimir Kolmogorov, Martin J. Wainwright:
On the Optimality of Tree-reweighted Max-product Message-passing. UAI 2005: 316-323 - [i4]Martin J. Wainwright, Elitza N. Maneva:
Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes. CoRR abs/cs/0508068 (2005) - [i3]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
MAP estimation via agreement on (hyper)trees: Message-passing and linear programming. CoRR abs/cs/0508070 (2005) - [i2]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
On divergences, surrogate loss functions, and decentralized detection. CoRR abs/math/0510521 (2005) - 2004
- [j5]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations. Stat. Comput. 14(2): 143-166 (2004) - [j4]Erik B. Sudderth, Martin J. Wainwright, Alan S. Willsky:
Embedded trees: estimation of Gaussian Processes on graphs with cycles. IEEE Trans. Signal Process. 52(11): 3136-3150 (2004) - [c11]XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan:
Decentralized detection and classification using kernel methods. ICML 2004 - [c10]Jon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, Martin J. Wainwright:
LP decoding corrects a constant fraction of errors. ISIT 2004: 68 - [i1]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A New Look at Survey Propagation and its Generalizations. CoRR cs.CC/0409012 (2004) - 2003
- [j3]Javier Portilla, Vasily Strela, Martin J. Wainwright, Eero P. Simoncelli:
Image denoising using scale mixtures of Gaussians in the wavelet domain. IEEE Trans. Image Process. 12(11): 1338-1351 (2003) - [j2]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
Tree-based reparameterization framework for analysis of sum-product and related algorithms. IEEE Trans. Inf. Theory 49(5): 1120-1146 (2003) - [c9]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
Tree-reweighted belief propagation algorithms and approximate ML estimation by pseudo-moment matching. AISTATS 2003: 308-315 - [c8]Martin J. Wainwright, Michael I. Jordan:
Semidefinite Relaxations for Approximate Inference on Graphs with Cycles. NIPS 2003: 369-376 - 2002
- [b1]Martin J. Wainwright:
Stochastic processes on graphs with cycles: geometric and variational approaches. Massachusetts Institute of Technology, Cambridge, MA, USA, 2002 - [j1]John W. Fisher III, Martin J. Wainwright, Erik B. Sudderth, Alan S. Willsky:
Statistical and Information-Theoretic Methods for Self-Organization and Fusion of Multimodal, Networked Sensors. Int. J. High Perform. Comput. Appl. 16(3): 337-353 (2002) - [c7]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
Exact MAP Estimates by (Hyper)tree Agreement. NIPS 2002: 809-816 - [c6]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
A New Class of upper Bounds on the Log Partition Function. UAI 2002: 536-543 - 2001
- [c5]Vasily Strela, Javier Portilla, Martin J. Wainwright, Eero P. Simoncelli:
Adaptive Wiener denoising using a Gaussian scale mixture model in the wavelet domain. ICIP (2) 2001: 37-40 - [c4]Martin J. Wainwright, Tommi S. Jaakkola, Alan S. Willsky:
Tree-based reparameterization for approximate inference on loopy graphs. NIPS 2001: 1001-1008 - 2000
- [c3]Martin J. Wainwright, Eero P. Simoncelli, Alan S. Willsky:
Random Cascades of Gaussian Scale Mixtures and Their Use in Modeling Natural Images With Application to Denoising. ICIP 2000: 260-263 - [c2]Martin J. Wainwright, Erik B. Sudderth, Alan S. Willsky:
Tree-Based Modeling and Estimation of Gaussian Processes on Graphs with Cycles. NIPS 2000: 661-667
1990 – 1999
- 1999
- [c1]Martin J. Wainwright, Eero P. Simoncelli:
Scale Mixtures of Gaussians and the Statistics of Natural Images. NIPS 1999: 855-861
Coauthor Index
[j84] [j82] [c121] [i130] [i129] [i123] [j78] [j77] [i118] [c115] [c114] [c111] [i113] [i112] [i111] [i109] [i107] [c109] [i105] [i101] [i98] [c105] [c103] [c101] [i96] [i95] [i90] [c100] [c98] [c95] [c92] [i85] [i81] [i80] [c87] [i78] [i76] [i75] [i74] [i70] [j54] [c84] [i67] [i64] [i61] [j52] [c82] [i58] [i56] [c80] [c78] [c76] [c75] [i49] [i46] [i44] [c69] [c68] [i40] [j28] [j21] [j20] [c48] [c37] [i20] [c29] [c28] [j10] [c19] [i5] [j6] [c15] [i2] [c11] [c8]
Sahand Negahban
aka: Sahand N. Negahban
aka: Sahand N. Negahban
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 2025-02-02 22:28 CET 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:
