Related papers: Optimal Orthogonal Group Synchronization and Rotat…
In this paper, the problems of frequency-limited and time-limited H2-optimal model order reduction of linear time-invariant systems are considered within the oblique projection framework. It is shown that it is inherently not possible to…
The angular synchronization problem of estimating a set of unknown angles from their known noisy pairwise differences arises in various applications. It can be reformulated as a optimization problem on graphs involving the graph Laplacian…
Convex optimization with sparsity-promoting convex regularization is a standard approach for estimating sparse signals in noise. In order to promote sparsity more strongly than convex regularization, it is also standard practice to employ…
How are we able to fix it so as to theoretically go over it, if the optimality and efficiency of the orbital angular momentum (OAM) multiplexing technique in a multi-input multi-output (MIMO) system fails in practice -- something that…
We develop a renormalization group method to investigate synchronization clusters in a one-dimensional chain of nearest-neighbor coupled phase oscillators. The method is best suited for chains with strong disorder in the intrinsic…
We propose an approach to assess the synchronization of rigidly mounted sensors based on their rotational motion. Using function similarity measures combined with a sliding window approach, our approach is capable of estimating time-varying…
We present a method for estimating the maximal symmetry of a continuous regression function. Knowledge of such a symmetry can be used to significantly improve modelling by removing the modes of variation resulting from the symmetries.…
We propose a new joint image reconstruction method by recovering edge directly from observed data. More specifically, we reformulate joint image reconstruction with vectorial total-variation regularization as an $l_1$ minimization problem…
We investigate the existence of an optimal interplay between the natural frequencies of a group chaotic oscillators and the topological properties of the network they are embedded in. We identify the conditions for achieving phase…
Recently, the precise performance of the Generalized LASSO algorithm for recovering structured signals from compressed noisy measurements, obtained via i.i.d. Gaussian matrices, has been characterized. The analysis is based on a framework…
We investigate the problem of estimating the structure factor, or spectra, of stationary spatial point processes. In the first part, we establish a minimax lower bound for this estimation problem, using an approach tailored to second-order…
We consider sparse matrix estimation where the goal is to estimate an $n\times n$ matrix from noisy observations of a small subset of its entries. We analyze the estimation error of the popularly utilized collaborative filtering algorithm…
In this work, we investigate data fitting problems with random noises. A randomized progressive iterative regularization method is proposed. It works well for large-scale matrix computations and converges in expectation to the least-squares…
Synchronization is an important dynamical phenomenon in coupled nonlinear systems, which has been studied extensively in recent years. However, analysis focused on individual orbits seems hard to extend to complex systems while a global…
This paper addresses signal denoising when large-amplitude coefficients form clusters (groups). The L1-norm and other separable sparsity models do not capture the tendency of coefficients to cluster (group sparsity). This work develops an…
Finding group elements from noisy measurements of their pairwise ratios is also known as the group synchronization problem, first introduced in the context of the group SO(2) of planar rotations, whose usefulness has been demonstrated…
In this work, we study contextual strongly convex simulation optimization and adopt an "optimize then predict" (OTP) approach for real-time decision making. In the offline stage, simulation optimization is conducted across a set of…
Optimization with matrix gradient orthogonalization has recently demonstrated impressive results in the training of deep neural networks (Jordan et al., 2024; Liu et al., 2025). In this paper, we provide a theoretical analysis of this…
The joint bidiagonalization process of a matrix pair $\{A,L\}$ can be used to develop iterative regularization algorithms for large scale ill-posed problems in general-form Tikhonov regularization…
We provide a statistical analysis of regularization-based continual learning on a sequence of linear regression tasks, with emphasis on how different regularization terms affect the model performance. We first derive the convergence rate…