In view of the composition analysis and identification of ancient glass products, L1 regularization, K-Means cluster analysis, elbow rule and other methods were comprehensively used to build logical regression, cluste...In view of the composition analysis and identification of ancient glass products, L1 regularization, K-Means cluster analysis, elbow rule and other methods were comprehensively used to build logical regression, cluster analysis, hyper-parameter test and other models, and SPSS, Python and other tools were used to obtain the classification rules of glass products under different fluxes, sub classification under different chemical compositions, hyper-parameter K value test and rationality analysis. Research can provide theoretical support for the protection and restoration of ancient glass relics.展开更多
The study on designs for the baseline parameterization has aroused attention in recent years. This paper focuses on two-level regular designs for the baseline parameterization. A general result on the relationship bet...The study on designs for the baseline parameterization has aroused attention in recent years. This paper focuses on two-level regular designs for the baseline parameterization. A general result on the relationship between K-aberration and word length pattern is developed.展开更多
Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The signif...Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.展开更多
In this article we consider the asymptotic behavior of extreme distribution with the extreme value index γ>0 . The rates of uniform convergence for Fréchet distribution are constructed under the second-order ...In this article we consider the asymptotic behavior of extreme distribution with the extreme value index γ>0 . The rates of uniform convergence for Fréchet distribution are constructed under the second-order regular variation condition.展开更多
We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner...We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner product defined on both the unit ball and the unit sphere, construct the kernel-regularized learning algorithm from the view of semi-supervised learning and bound the upper bounds for the learning rates. The theory analysis shows that the learning algorithm has better uniform convergence according to the number of samples. The research can be regarded as an application of kernel-regularized semi-supervised learning.展开更多
This paper considers the regularity of solutions to mixed boundary value problems in small-angle regions for elliptic equations. By constructing a specific barrier function, we proved that under the assumption of suff...This paper considers the regularity of solutions to mixed boundary value problems in small-angle regions for elliptic equations. By constructing a specific barrier function, we proved that under the assumption of sufficient regularity of boundary conditions and coefficients, as long as the angle is sufficiently small, the regularity of the solution to the mixed boundary value problem of the second-order elliptic equation can reach any order.展开更多
In this paper, we study the viscosity solutions of the Neumann problem in a bounded C<sup>2</sup> domain Ω, where Δ<sup>N</sup>∞</sub> is called the normalized infinity Laplacian. The ...In this paper, we study the viscosity solutions of the Neumann problem in a bounded C<sup>2</sup> domain Ω, where Δ<sup>N</sup>∞</sub> is called the normalized infinity Laplacian. The normalized infinity Laplacian was first studied by Peres, Shramm, Sheffield and Wilson from the point of randomized theory named tug-of-war, which has wide applications in optimal mass transportation, financial option price problems, digital image processing, physical engineering, etc. We give the Lipschitz regularity of the viscosity solutions of the Neumann problem. The method we adopt is to choose suitable auxiliary functions as barrier functions and combine the perturbation method and viscosity solutions theory. .展开更多
This article compares the isotropic and anisotropic TV regularizations used in inverse acoustic scattering. It is observed that compared with the traditional Tikhonov regularization, isotropic and anisotropic TV regul...This article compares the isotropic and anisotropic TV regularizations used in inverse acoustic scattering. It is observed that compared with the traditional Tikhonov regularization, isotropic and anisotropic TV regularizations perform better in the sense of edge preserving. While anisotropic TV regularization will cause distortions along axes. To minimize the energy function with isotropic and anisotropic regularization terms, we use split Bregman scheme. We do several 2D numerical experiments to validate the above arguments.展开更多
When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are func...When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are functions of the parameter, finding good approximation for the sampling distribution of MLE (needed to construct an accurate confidence interval for the parameter’s true value) may get very challenging. We demonstrate the nature of this problem, and show how to deal with it, by a detailed study of a specific situation. We also indicate several possible ways to bypass MLE by proposing alternate estimators;these, having relatively simple sampling distributions, then make constructing a confidence interval rather routine. .展开更多
When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are func...When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are functions of the parameter, finding good approximation for the sampling distribution of MLE (needed to construct an accurate confidence interval for the parameter’s true value) may get very challenging. We demonstrate the nature of this problem, and show how to deal with it, by a detailed study of a specific situation. We also indicate several possible ways to bypass MLE by proposing alternate estimators;these, having relatively simple sampling distributions, then make constructing a confidence interval rather routine. .展开更多
In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regul...In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regularization methods to approximate solutions of following variational inequalities: and with operator A being monotone hemi-continuous form real Banach reflexive X into its dual space X*, but instead of knowing the exact data (y<sub>0</sub>, A), we only know its approximate data satisfying certain specified conditions and D is a nonempty convex closed subset of X;the real function f defined on X is assumed to be lower semi-continuous, convex and is not identical to infinity. At the same time, we will evaluate the convergence rate of the approximate solution. The regularization methods here are different from the previous ones.展开更多
文摘In view of the composition analysis and identification of ancient glass products, L1 regularization, K-Means cluster analysis, elbow rule and other methods were comprehensively used to build logical regression, cluster analysis, hyper-parameter test and other models, and SPSS, Python and other tools were used to obtain the classification rules of glass products under different fluxes, sub classification under different chemical compositions, hyper-parameter K value test and rationality analysis. Research can provide theoretical support for the protection and restoration of ancient glass relics.
文摘The study on designs for the baseline parameterization has aroused attention in recent years. This paper focuses on two-level regular designs for the baseline parameterization. A general result on the relationship between K-aberration and word length pattern is developed.
文摘Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.
文摘In this article we consider the asymptotic behavior of extreme distribution with the extreme value index γ>0 . The rates of uniform convergence for Fréchet distribution are constructed under the second-order regular variation condition.
文摘We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner product defined on both the unit ball and the unit sphere, construct the kernel-regularized learning algorithm from the view of semi-supervised learning and bound the upper bounds for the learning rates. The theory analysis shows that the learning algorithm has better uniform convergence according to the number of samples. The research can be regarded as an application of kernel-regularized semi-supervised learning.
文摘This paper considers the regularity of solutions to mixed boundary value problems in small-angle regions for elliptic equations. By constructing a specific barrier function, we proved that under the assumption of sufficient regularity of boundary conditions and coefficients, as long as the angle is sufficiently small, the regularity of the solution to the mixed boundary value problem of the second-order elliptic equation can reach any order.
文摘In this paper, we study the viscosity solutions of the Neumann problem in a bounded C<sup>2</sup> domain Ω, where Δ<sup>N</sup>∞</sub> is called the normalized infinity Laplacian. The normalized infinity Laplacian was first studied by Peres, Shramm, Sheffield and Wilson from the point of randomized theory named tug-of-war, which has wide applications in optimal mass transportation, financial option price problems, digital image processing, physical engineering, etc. We give the Lipschitz regularity of the viscosity solutions of the Neumann problem. The method we adopt is to choose suitable auxiliary functions as barrier functions and combine the perturbation method and viscosity solutions theory. .
文摘This article compares the isotropic and anisotropic TV regularizations used in inverse acoustic scattering. It is observed that compared with the traditional Tikhonov regularization, isotropic and anisotropic TV regularizations perform better in the sense of edge preserving. While anisotropic TV regularization will cause distortions along axes. To minimize the energy function with isotropic and anisotropic regularization terms, we use split Bregman scheme. We do several 2D numerical experiments to validate the above arguments.
文摘When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are functions of the parameter, finding good approximation for the sampling distribution of MLE (needed to construct an accurate confidence interval for the parameter’s true value) may get very challenging. We demonstrate the nature of this problem, and show how to deal with it, by a detailed study of a specific situation. We also indicate several possible ways to bypass MLE by proposing alternate estimators;these, having relatively simple sampling distributions, then make constructing a confidence interval rather routine. .
文摘When dealing with a regular (fixed-support) one-parameter distribution, the corresponding maximum-likelihood estimator (MLE) is, to a good approximation, normally distributed. But, when the support boundaries are functions of the parameter, finding good approximation for the sampling distribution of MLE (needed to construct an accurate confidence interval for the parameter’s true value) may get very challenging. We demonstrate the nature of this problem, and show how to deal with it, by a detailed study of a specific situation. We also indicate several possible ways to bypass MLE by proposing alternate estimators;these, having relatively simple sampling distributions, then make constructing a confidence interval rather routine. .
文摘In this paper, we study the regularization methods to approximate the solutions of the variational inequalities with monotone hemi-continuous operator having perturbed operators arbitrary. Detail, we shall study regularization methods to approximate solutions of following variational inequalities: and with operator A being monotone hemi-continuous form real Banach reflexive X into its dual space X*, but instead of knowing the exact data (y<sub>0</sub>, A), we only know its approximate data satisfying certain specified conditions and D is a nonempty convex closed subset of X;the real function f defined on X is assumed to be lower semi-continuous, convex and is not identical to infinity. At the same time, we will evaluate the convergence rate of the approximate solution. The regularization methods here are different from the previous ones.
