SearcharxivSearch

arXiv subjects

Matthew S. Scott

Publications and source records attributed to Matthew S. Scott.

5 recordsLinked to original sources

Convexity from order: a theory of faces and generalized separation

It is known that any convex cone in a general vector space is the positive cone of a preorder compatible with the vector space, and that any convex set is an affine slice of a convex cone. We therefore treat convex sets order-theoretically, as affine slices of positive cones. We find that faces are sets of strong minima, and we generalize functionals to oriented maps valued in arbitrary ordered vector spaces. Oriented maps expose every face, and an oriented affine map $f$ separates $C$ from $D$ when $f(D) \le 0 \le f(C)$ element-wise. This generalization of hyperplane separation recovers mathematical objects that are "local", including the generated face at a point and the normal cone. The kernels of separating oriented maps form a lattice of separating affine flats whose bottom element is the joint supporting subspace (JSS), recently introduced in finite dimensions for qualification-free convex analysis results. We define the JSS in general vector spaces for two convex sets $C, D$ as the affine slice of the cross-lineality $\mathrm{lin}(K-G)$, where $K,G$ are the homogenization cones of $C, D$. We show that in finite dimensions, bilateral facial reduction corresponds to a descent in the lattice of separating affine flats, which we formalize as lexicographic products of oriented maps. The lexicographic characterization of faces follows as a corollary. By making no assumption other than convexity, our approach yields general results: we show that the face of a difference of two convex sets is a difference of faces, dropping assumptions of compactness, finite dimensionality, and exposedness. We also show that any face of an intersection of two convex sets is an intersection of faces, resolving open problem 5.10 by Weis in "A note on faces of convex sets", dropping the assumption of non-empty intrinsic core.

math.OC

Partially deterministic sampling for compressed sensing with denoising guarantees

We study compressed sensing when the sampling vectors are chosen from the rows of a unitary matrix. In the literature, these sampling vectors are typically chosen randomly; the use of randomness has enabled major empirical and theoretical advances in the field. However, in practice there are often certain crucial sampling vectors, in which case practitioners will depart from the theory and sample such rows deterministically. In this work, we derive an optimized sampling scheme for Bernoulli selectors which naturally combines random and deterministic selection of rows, thus rigorously deciding which rows should be sampled deterministically. This sampling scheme provides measurable improvements in image compressed sensing for both generative and sparse priors when compared to with-replacement and without-replacement sampling schemes, as we show with theoretical results and numerical experiments. Additionally, our theoretical guarantees feature improved sample complexity bounds compared to previous works, and novel denoising guarantees in this setting.

cs.IT

Average-case thresholds for exact regularization of linear programs

Small regularizers can preserve linear programming solutions exactly. This paper provides the first average-case analysis of exact regularization: with a standard Gaussian cost vector and fixed constraint set, bounds are established for the probability that exact regularization succeeds as a function of regularization strength. Failure is characterized via the Gaussian measure of inner cones, controlled by novel two-sided bounds on the measure of shifted cones. Results reveal dimension-dependent scaling laws and connect exact regularization of linear programs to their polyhedral geometry via the normal fan and the Gaussian (solid-angle) measure of its cones. Computable bounds are obtained in several canonical settings, including regularized optimal transport. Numerical experiments corroborate the predicted scalings and thresholds.

math.OC

Bilateral facial reduction: qualification-free subdifferential calculus and exact duality

Qualification conditions (also termed constraint qualifications) help avoid pathological behavior at domain boundaries in convex analysis. By generalizing facial reduction from conic programming to general convex programs of the form $f(x) + g(Ax)$, we provide qualification-free generalizations of several key results: an exact Fenchel-Rockafellar dual, KKT optimality conditions, an attained infimal convolution for the conjugate of a sum, subdifferential sum and chain rules, and normal cones of intersections. All our results reduce seamlessly to their original formulations when qualification conditions hold. The core insight is that for a sum of two convex functions, there is an affine subspace$\unicode{x2014}$the joint supporting subspace$\unicode{x2014}$that contains the feasible region, and such that qualification conditions hold when restricting the effective domain of each function to it. We offer a number of characterizations for the joint supporting subspace, including one that obtains the affine subspace via iterative, bilateral reduction between the two domains. In our proofs, which are self-contained, we develop a structured induction on faces where inductive steps are associated with normal vectors nested in supporting subspaces (a generalization of supporting hyperplanes). With this tool, we characterize the facial structure of the difference of two convex sets from the facial structures of the individual convex sets.

math.OC

Denoising guarantees for optimized sampling schemes in compressed sensing

Compressed sensing with subsampled unitary matrices benefits from \emph{optimized} sampling schemes, which feature improved theoretical guarantees and empirical performance relative to uniform subsampling. We provide, in a first of its kind in compressed sensing, theoretical guarantees showing that the error caused by the measurement noise vanishes with an increasing number of measurements for optimized sampling schemes, assuming that the noise is Gaussian. We moreover provide similar guarantees for measurements sampled with-replacement with arbitrary probability weights. All our results hold on prior sets contained in a union of low-dimensional subspaces. Finally, we demonstrate that this denoising behavior appears in empirical experiments with a rate that closely matches our theoretical guarantees when the prior set is the range of a generative ReLU neural network and when it is the set of sparse vectors.

stat.ML