2023
Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP.
SIAM J. Matrix Anal. Appl., December, 2023
Math. Program., March, 2023
Spectrahedral Regression.
SIAM J. Optim., 2023
Modeling groundwater levels in California's Central Valley by hierarchical Gaussian process and neural network regression.
CoRR, 2023
2022
Convex graph invariant relaxations for graph edit distance.
Math. Program., 2022
2021
Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization.
Math. Program. Comput., 2021
Signomial and polynomial optimization via relative entropy and partial dualization.
Math. Program. Comput., 2021
Newton Polytopes and Relative Entropy Optimization.
Found. Comput. Math., 2021
Fitting Tractable Convex Sets to Support Function Evaluations.
Discret. Comput. Geom., 2021
2020
Learning Exponential Family Graphical Models with Latent Variables using Regularized Conditional Likelihood.
CoRR, 2020
2019
Learning Semidefinite Regularizers.
Found. Comput. Math., 2019
2018
Finding Planted Subgraphs with Few Eigenvalues using the Schur-Horn Relaxation.
SIAM J. Optim., 2018
Interpreting latent variables in factor models via convex optimization.
Math. Program., 2018
2017
Relative entropy optimization and its applications.
Math. Program., 2017
A Matrix Factorization Approach for Learning Semidefinite-Representable Regularizers.
CoRR, 2017
2016
Regularization for Design.
IEEE Trans. Autom. Control., 2016
Relative Entropy Relaxations for Signomial Optimization.
SIAM J. Optim., 2016
Resource Allocation for Statistical Estimation.
Proc. IEEE, 2016
Recovering Games from Perturbed Equilibrium Observations Using Convex Optimization.
CoRR, 2016
2015
High-dimensional change-point estimation: Combining filtering with convex optimization.
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Conic geometric programming.
Proceedings of the 48th Annual Conference on Information Sciences and Systems, 2014
2012
Feedback Message Passing for Inference in Gaussian Graphical Models.
IEEE Trans. Signal Process., 2012
Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting.
SIAM J. Matrix Anal. Appl., 2012
The Convex Geometry of Linear Inverse Problems.
Found. Comput. Math., 2012
Computational and Statistical Tradeoffs via Convex Relaxation
CoRR, 2012
Rejoinder: Latent variable graphical model selection via convex optimization
CoRR, 2012
Recovery of Sparse Probability Measures via Convex Programming.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012
Group symmetry and covariance regularization.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012
2011
Convex optimization methods for graphs and statistical modeling.
PhD thesis, 2011
Rank-Sparsity Incoherence for Matrix Decomposition.
SIAM J. Optim., 2011
Counting Independent Sets Using the Bethe Approximation.
SIAM J. Discret. Math., 2011
Tree-structured statistical modeling via convex optimization.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011
Iterative projections for signal identification on manifolds: Global recovery guarantees.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011
2010
Gaussian multiresolution models: exploiting sparse Markov and covariance structure.
IEEE Trans. Signal Process., 2010
The Convex algebraic geometry of linear inverse problems.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
Latent variable graphical model selection via convex optimization.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
2009
Representation and Compression of Multidimensional Piecewise Functions Using Surflets.
IEEE Trans. Inf. Theory, 2009
Exploiting sparse Markov <i>and</i> covariance structure in multiresolution models.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009
Sparse and low-rank matrix decompositions.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009
2008
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis.
IEEE Trans. Signal Process., 2008
Complexity of Inference in Graphical Models.
Proceedings of the UAI 2008, 2008
Maximum entropy relaxation for multiscale graphical model selection.
Proceedings of the IEEE International Conference on Acoustics, 2008
2007
Learning Markov Structure by Maximum Entropy Relaxation.
Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007
Adaptive Embedded Subgraph Algorithms using Walk-Sum Analysis.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007
2004
Surflets: a sparse representation for multidimensional functions containing smooth discontinuities.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004