相关论文: Structured Backward Errors of Sparse Generalized S…

Structured sparsity is an important modeling tool that expands the applicability of convex formulations for data analysis, however it also creates significant challenges for efficient algorithm design. In this paper we investigate the…

Sequential learning with Gaussian processes (GPs) is challenging when access to past data is limited, for example, in continual and active learning. In such cases, errors can accumulate over time due to inaccuracies in the posterior,…

In this paper, we provide some analysis on the asymptotic escape of strict saddles in manifold optimization using the projected gradient descent (PGD) algorithm. One of our main contributions is that we extend the current analysis to…

Adapting large pre-trained models (PTMs) through fine-tuning imposes prohibitive computational and storage burdens. Recent studies of parameter-efficient tuning (PET) find that only optimizing a small portion of parameters conditioned on…

The communication bottleneck has been a critical problem in large-scale distributed deep learning. In this work, we study distributed SGD with random block-wise sparsification as the gradient compressor, which is ring-allreduce compatible…

We consider the problem of recovering block-sparse signals whose structures are unknown \emph{a priori}. Block-sparse signals with nonzero coefficients occurring in clusters arise naturally in many practical scenarios. However, the…

Bayesian change-point and segmentation models provide uncertainty-aware piecewise-constant representations of ordered data, but exact inference is often limited to narrow likelihood classes, single sequences, or index-uniform designs. We…

Several learning applications require solving high-dimensional regression problems where the relevant features belong to a small number of (overlapping) groups. For very large datasets and under standard sparsity constraints, hard…

Many nonconvex problems in robotics can be relaxed into convex formulations via Semi-Definite Programming (SDP) that can be solved to global optimality. The practical quality of these solutions, however, critically depends on rounding them…

We revisit the classic stability problem of the buckling of an inextensible, axially compressed beam on a nonlinear elastic foundation with a semi-analytical approach to understand how spatially localized deformation solutions emerge in…

Saddle point problems arise in many important practical applications. In this paper we propose and analyze some algorithms for solving symmetric saddle point problems which are based upon the block Gram-Schmidt method. In particular, we…

Sparse random projection (RP) is a popular tool for dimensionality reduction that shows promising performance with low computational complexity. However, in the existing sparse RP matrices, the positions of non-zero entries are usually…

In this paper we propose a new kind of high order numerical scheme for backward stochastic differential equations(BSDEs). Unlike the traditional $\theta$-scheme, we reduce truncation errors by taking $\theta$ carefully for every subinterval…

In this paper, we study a collection of mean-reflected backward stochastic differential equations driven by $G$-Brownian motions ($G$-BSDEs), where $G$-expectations are constrained in some time-dependent intervals. To establish…

Recently it has become popular to learn sparse Gaussian graphical models (GGMs) by imposing l1 or group l1,2 penalties on the elements of the precision matrix. Thispenalized likelihood approach results in a tractable convex optimization…

In this paper, we obtain stability results for backward stochastic differential equations with jumps (BSDEs) in a very general framework. More specifically, we consider a convergent sequence of standard data, each associated to their own…

We generalize the well-known primal-dual algorithm proposed by Chambolle and Pock for saddle point problems, and improve the condition for ensuring its convergence. The improved convergence-guaranteeing condition is effective for the…

High-order difference operators with the summation-by-parts (SBP) property can be used to build stable discretizations of hyperbolic conservation laws; however, most high-order SBP operators require a conforming, high-order mesh for the…

For the singular saddle-point problems with nonsymmetric positive definite $(1,1)$ block, we present a general constraint preconditioning (GCP) iteration method based on a singular constraint preconditioner. Using the properties of the…

We propose a new variational inference algorithm for learning in Gaussian Process State-Space Models (GPSSMs). Our algorithm enables learning of unstable and partially observable systems, where previous algorithms fail. Our main algorithmic…