James Saunderson

Orcid: 0000-0002-5456-0180

According to our database1, James Saunderson authored at least 46 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Information Rates of the Noisy Nanopore Channel.
IEEE Trans. Inf. Theory, August, 2024

A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms.
IEEE Trans. Inf. Theory, August, 2024

Hyperbolicity cones are amenable.
Math. Program., March, 2024

Robust Non-adaptive Group Testing under Errors in Group Membership Specifications.
CoRR, 2024

Exploiting Structure in Quantum Relative Entropy Programs.
CoRR, 2024

On Noisy Duplication Channels with Markov Sources.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Optimal Self-Concordant Barriers for Quantum Relative Entropies.
SIAM J. Optim., December, 2023

Spinsim: A GPU optimized python package for simulating spin-half and spin-one quantum systems.
Comput. Phys. Commun., June, 2023

Terracini convexity.
Math. Program., March, 2023

A Convex Form That Is Not a Sum of Squares.
Math. Oper. Res., February, 2023

Efficient Computation of the Quantum Rate-Distortion Function.
CoRR, 2023

A Mirror Descent Perspective on Classical and Quantum Blahut-Arimoto Algorithms.
CoRR, 2023

Homophonic Coding for the Noisy Nanopore Channel with Constrained Markov Sources.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A Scalable Frank-Wolfe-Based Algorithm for the Max-Cut SDP.
Proceedings of the International Conference on Machine Learning, 2023

A Bregman Divergence View on the Difference-of-Convex Algorithm.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Amenable Cones Are Particularly Nice.
SIAM J. Optim., September, 2022

Lifting for Simplicity: Concise Descriptions of Convex Sets.
SIAM Rev., 2022

Finite-State Semi-Markov Channels for Nanopore Sequencing.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Memory-Efficient Structured Convex Optimization via Extreme Point Sampling.
SIAM J. Math. Data Sci., 2021

Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Limitations on the Expressive Power of Convex Cones without Long Chains of Faces.
SIAM J. Optim., 2020

2019
Metric-Constrained Optimization for Graph Clustering Algorithms.
SIAM J. Math. Data Sci., 2019

Certifying Polynomial Nonnegativity via Hyperbolic Optimization.
SIAM J. Appl. Algebra Geom., 2019

Semidefinite Approximations of the Matrix Logarithm.
Found. Comput. Math., 2019

2018
A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone.
Optim. Lett., 2018

Symmetric sums of squares over k-subset hypercubes.
Math. Program., 2018

Competitive online algorithms for resource allocation over the positive semidefinite cone.
Math. Program., 2018

A Projection Method for Metric-Constrained Optimization.
CoRR, 2018

2017
Equivariant Semidefinite Lifts of Regular Polygons.
Math. Oper. Res., 2017

Error bounds for Bregman denoising and structured natural parameter estimation.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Improving efficiency and scalability of sum of squares optimization: Recent advances and limitations.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016
Sparse sums of squares on finite abelian groups and improved semidefinite lifts.
Math. Program., 2016

Simple algorithms and guarantees for low rank matrix completion over F2.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Phaseless super-resolution using masks.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

2015
Semidenite representations with applications in estimation and inference.
PhD thesis, 2015

Semidefinite Descriptions of the Convex Hull of Rotation Matrices.
SIAM J. Optim., 2015

Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies.
SIAM J. Optim., 2015

Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones.
Math. Program., 2015

Sparse sum-of-squares certificates on finite abelian groups.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015

2014
Semidefinite relaxations for optimization problems over rotation matrices.
Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2013
Analyzing Hogwild Parallel Gaussian Gibbs Sampling.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Diagonal and low-rank decompositions and fitting ellipsoids to random points.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

2012
Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting.
SIAM J. Matrix Anal. Appl., 2012

2011
Tree-structured statistical modeling via convex optimization.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2008
Spectral clustering with inconsistent advice.
Proceedings of the Machine Learning, 2008

A Local-Search 2-Approximation for 2-Correlation-Clustering.
Proceedings of the Algorithms, 2008


  Loading...