相关论文: Spectral connvergece of random feature method in o…

Learning the joint probability of random variables (RVs) is the cornerstone of statistical signal processing and machine learning. However, direct nonparametric estimation for high-dimensional joint probability is in general impossible, due…

A key property of neural networks is their capacity of adapting to data during training. Yet, our current mathematical understanding of feature learning and its relationship to generalization remain limited. In this work, we provide a…

This study focuses on solving group zero-norm regularized robust loss minimization problems. We propose a proximal Majorization-Minimization (PMM) algorithm to address a class of equivalent Difference-of-Convex (DC) surrogate optimization…

We introduce a new perspective on spectral dimensionality reduction which views these methods as Gaussian Markov random fields (GRFs). Our unifying perspective is based on the maximum entropy principle which is in turn inspired by maximum…

Object detection plays an important role in various fields. Developing detection models for 2D objects that experience rotation and texture variations is a challenge. In this research, the initial stage of the proposed model integrates the…

The neutrino closure method is often used to obtain kinematics of semileptonic decays with one unreconstructed particle. The kinematics of decays can be deducted by a two-fold ambiguity with a quadratic equation. To resolve the two-fold…

In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to…

Uniform Manifold Approximation and Projection (UMAP) is a widely used manifold learning technique for dimensionality reduction. This paper studies UMAP, supervised UMAP, and several competing dimensionality reduction methods, including…

In the author's previous paper (Zhang et al. 2022), exponential convergence was proved for the perfectly matched layers (PML) approximation of scattering problems with periodic surfaces in 2D. However, due to the overlapping of…

In this paper we combine the stochastic variance reduced gradient (SVRG) method [17] with the primal dual fixed point method (PDFP) proposed in [7] to solve a sum of two convex functions and one of which is linearly composite. This type of…

Affine rank minimization algorithms typically rely on calculating the gradient of a data error followed by a singular value decomposition at every iteration. Because these two steps are expensive, heuristic approximations are often used to…

Random Fourier features (RFF) represent one of the most popular and wide-spread techniques in machine learning to scale up kernel algorithms. Despite the numerous successful applications of RFFs, unfortunately, quite little is understood…

We present a novel feature matching algorithm that systematically utilizes the geometric properties of features such as position, scale, and orientation, in addition to the conventional descriptor vectors. In challenging scenes with the…

We study generalization properties of distributed algorithms in the setting of nonparametric regression over a reproducing kernel Hilbert space (RKHS). We first investigate distributed stochastic gradient methods (SGM), with mini-batches…

The semiparametric regression models have attracted increasing attention owing to their robustness compared to their parametric counterparts. This paper discusses the efficiency bound for functional response models (FRM), an emerging class…

Using the standard finite element method (FEM) to solve general partial differential equations, the round-off error is found to be proportional to $N^{\beta_{\rm R}}$, with $N$ the number of degrees of freedom (DoFs) and $\beta_{\rm R}$ a…

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast…

The Random Batch Method (RBM) [S. Jin, L. Li and J.-G. Liu, Random Batch Methods (RBM) for interacting particle systems, J. Comput. Phys. 400 (2020) 108877] is not only an efficient algorithm for simulating interacting particle systems, but…

Self-consistent relativistic random-phase approximation (RPA) in the radial coordinate representation is established by using the finite amplitude method (FAM). Taking the isoscalar giant monopole resonance in spherical nuclei as example,…

In our previous works, we proved that the inverse of the stiffness matrix of an $h$-version finite element method (FEM) applied to scalar second order elliptic boundary value problems can be approximated at an exponential rate in the block…