This paper is a continuation of recent work by Guo-Xiang-Zheng[10].We deduce the sharp Morrey regularity theory for weak solutions to the fourth order nonhomogeneous Lamm-Rivière equation △^{2}u=△(V▽u)+div(w▽...This paper is a continuation of recent work by Guo-Xiang-Zheng[10].We deduce the sharp Morrey regularity theory for weak solutions to the fourth order nonhomogeneous Lamm-Rivière equation △^{2}u=△(V▽u)+div(w▽u)+(▽ω+F)·▽u+f in B^(4),under the smallest regularity assumptions of V,ω,ω,F,where f belongs to some Morrey spaces.This work was motivated by many geometrical problems such as the flow of biharmonic mappings.Our results deepens the Lp type regularity theory of[10],and generalizes the work of Du,Kang and Wang[4]on a second order problem to our fourth order problems.展开更多
In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search spa...In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach.展开更多
In this paper, we characterize lower semi-continuous pseudo-convex functions f : X → R ∪ {+ ∞} on convex subset of real Banach spaces K ⊂ X with respect to the pseudo-monotonicity of its Clarke-Rockafellar Su...In this paper, we characterize lower semi-continuous pseudo-convex functions f : X → R ∪ {+ ∞} on convex subset of real Banach spaces K ⊂ X with respect to the pseudo-monotonicity of its Clarke-Rockafellar Sub-differential. We extend the results on the characterizations of non-smooth convex functions f : X → R ∪ {+ ∞} on convex subset of real Banach spaces K ⊂ X with respect to the monotonicity of its sub-differentials to the lower semi-continuous pseudo-convex functions on real Banach spaces.展开更多
The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy ...The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.展开更多
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.展开更多
Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which...Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.展开更多
In this paper, we deal with nonlinear ill-posed problems involving m-accretive mappings in Banach spaces. We consider a derivative and inverse free method for the imple- mentation of Lavrentiev regularization method. ...In this paper, we deal with nonlinear ill-posed problems involving m-accretive mappings in Banach spaces. We consider a derivative and inverse free method for the imple- mentation of Lavrentiev regularization method. Using general HSlder type source condition we obtain an optimal order error estimate. Also we consider the adaptive parameter choice strategy proposed by Pereverzev and Schock (2005) for choosing the regularization parameter.展开更多
There is little work concerning the properties of quaternionic operators acting on slice regular function spaces defined on quaternions.In this paper,we present an equivalent characterization for the boundedness of th...There is little work concerning the properties of quaternionic operators acting on slice regular function spaces defined on quaternions.In this paper,we present an equivalent characterization for the boundedness of the product operator C_(φ)D^(m) acting on Bloch-type spaces of slice regular functions.After that,an equivalent estimation for its essential norm is established,which can imply several existing results on holomorphic spaces.展开更多
Some strong convergence theorems of explicit composite iteration scheme for nonexpansive semi-groups in the framework of Banach spaces are established. Results presented in the paper not only extend and improve the co...Some strong convergence theorems of explicit composite iteration scheme for nonexpansive semi-groups in the framework of Banach spaces are established. Results presented in the paper not only extend and improve the corresponding results of ShiojiTakahashi, Suzuki, Xu and Aleyner-Reich, but also give a partially affirmative answer to the open questions raised by Suzuki and Xu.展开更多
In this paper, we show the existence and regularity of mild solutions depending on the small initial data in Besov spaces to the fractional porous medium equation. When 1 < <em>α</em> ≤ 2, we prove gl...In this paper, we show the existence and regularity of mild solutions depending on the small initial data in Besov spaces to the fractional porous medium equation. When 1 < <em>α</em> ≤ 2, we prove global well-posedness for initial data <img src="Edit_b7b43d4c-00d8-49d6-9066-97151fb5c337.bmp" alt="" /> with 1 ≤ <em>p</em> < ∞, 1 ≤ <em>q</em> ≤ ∞, and analyticity of solutions with 1 < <em>p</em> < ∞, 1 ≤ <em>q</em> ≤ ∞. In particular, we also proved that when <em>α</em> = 1, both <em>u</em> and <img src="Edit_a5af0853-8adc-4a08-b8a2-b9a70ea0f409.bmp" alt="" /> belong to <img src="Edit_03a932cc-aa58-4568-83ad-f16416cc7b71.bmp" alt="" />. We solve this equation through the contraction mapping method based on Littlewood-Paley theory and Fourier multiplier. Furthermore, we can get time decay estimates of global solutions in Besov spaces, which is <img src="Edit_083986e9-4e1c-4494-ac5d-a7d30a12df97.bmp" alt="" /> as <em>t</em> → ∞.展开更多
Let E and F be Banach lattices. It is known that if every continuous linear operator from E into F is regular, then, under some mild assumptions on E or F, either E is lattice isomorphic to an AL-space or F is lattice...Let E and F be Banach lattices. It is known that if every continuous linear operator from E into F is regular, then, under some mild assumptions on E or F, either E is lattice isomorphic to an AL-space or F is lattice isomorphic to an AM-space. Here we present a characterization on an AL-space E such that every bounded linear operator from E into a Banach lattice is regular. A counterexample is also provided, which shows that the results are unexpected even if the domain is an AL-space or the range space is an AM-space.展开更多
In this paper, we consider the regularized learning schemes based on l1-regularizer and pinball loss in a data dependent hypothesis space. The target is the error analysis for the quantile regression learning. There i...In this paper, we consider the regularized learning schemes based on l1-regularizer and pinball loss in a data dependent hypothesis space. The target is the error analysis for the quantile regression learning. There is no regularized condition with the kernel function, excepting continuity and boundness. The graph-based semi-supervised algorithm leads to an extra error term called manifold error. Part of new error bounds and convergence rates are exactly derived with the techniques consisting of l1-empirical covering number and boundness decomposition.展开更多
In this paper we shall generalize the definition given in [1] for Lipschitz condition and contractions for functions on a non-metrizable space, besides we shall give more properties of semi-linear uniform spaces.
A new adaptive filtering principle based on capability control and semi-blind method is presented. A new semi-blind space-time equalizer based on constant modulus characteristic and structure risk minimum (SRM) crit...A new adaptive filtering principle based on capability control and semi-blind method is presented. A new semi-blind space-time equalizer based on constant modulus characteristic and structure risk minimum (SRM) criterion is also proposed. The equalizer sufficiently exploits the learning information of communication signals by using the structure information of filter itself through capability control technique. Namely, it maximizes the amount of learning information to im- prove filter tracking performance. Simulations are carried out and the result is compared with that of typical recursive least squares space-time equalizer (RLS-STE) and constant modulus semi-blind space-time equalizer ( CM-SB-STE ). The results show that, even if with insufficient training data, the SRM constant modulus semi-blind space-time equalizer (SCM-SB-STE) keeps good tracking per- formance, showing promises in mobile wireless communications.展开更多
Let R be a ring and I an ideal of R. A ring R is called I-semi-π--regular if R/I is π-regular and idempotents of R can be strongly lifted modulo I. Characterizations of I-semi-π-regular rings are given and relation...Let R be a ring and I an ideal of R. A ring R is called I-semi-π--regular if R/I is π-regular and idempotents of R can be strongly lifted modulo I. Characterizations of I-semi-π-regular rings are given and relations between semi-π-regular rings and semiregular rings are explored.展开更多
<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral p...<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral polygons of</span><span style="font-family:Verdana;"> the same type. Tiling a plane with semi-regular polygons depends not only on the type of a semi-regular polygon, but also on its interior angles that join at a node. In relation to the interior angles, semi-regular equilateral polygons with the same or different interior angles can be joined in the nodes. Here, we shall first consider tiling a plane with semi-regular equilateral polygons with 2m-sides. The analysis is performed by determining the set of all integer solutions of the corresponding Diophantine equation in the form of <img alt="" src="Edit_c185b1c4-6b78-4af5-b1c2-4932af77bf65.png" />, where<img alt="" src="Edit_2e6548d5-3254-4005-b19e-9d49cd5d6f81.png" />are the non-negative integers which are not equal to zero at the same time, and <img alt="" src="Edit_a6dbde8a-5f3a-43d4-bc89-27dcc3057d23.png" />are the interior angles of a semi-regular equilateral polygon from the characteristic angle. It is shown that of all semi-regular equilateral polygons with 2m-sides, a plane can be tiled only with the semi-regular equilateral quadrilaterals and semi-regular equilateral hexagons. Then, the problem of tiling a plane with semi-regular equilateral quadrilaterals is analyzed in detail, and then the one with semi-regular equilateral hexagons. For these semi-regular polygons, all possible solutions of the corresponding Diophantine equations were analyzed and all nodes were determined, and then the problem for different values of characteristic elements was observed. For some of the observed cases of tiling a plane with these semi-regular polygons, some graphical presentations of tiling constructions are also given.</span> </p>展开更多
基金supported by the National Natural Science Foundation of China(12271296,12271195).
文摘This paper is a continuation of recent work by Guo-Xiang-Zheng[10].We deduce the sharp Morrey regularity theory for weak solutions to the fourth order nonhomogeneous Lamm-Rivière equation △^{2}u=△(V▽u)+div(w▽u)+(▽ω+F)·▽u+f in B^(4),under the smallest regularity assumptions of V,ω,ω,F,where f belongs to some Morrey spaces.This work was motivated by many geometrical problems such as the flow of biharmonic mappings.Our results deepens the Lp type regularity theory of[10],and generalizes the work of Du,Kang and Wang[4]on a second order problem to our fourth order problems.
基金This work was supported in part by the National Natural Science Foundation of China under Grant 61305001the Natural Science Foundation of Heilongjiang Province of China under Grant F201222.
文摘In differentiable search architecture search methods,a more efficient search space design can significantly improve the performance of the searched architecture,thus requiring people to carefully define the search space with different complexity according to various operations.Meanwhile rationalizing the search strategies to explore the well-defined search space will further improve the speed and efficiency of architecture search.With this in mind,we propose a faster and more efficient differentiable architecture search method,AllegroNAS.Firstly,we introduce a more efficient search space enriched by the introduction of two redefined convolution modules.Secondly,we utilize a more efficient architectural parameter regularization method,mitigating the overfitting problem during the search process and reducing the error brought about by gradient approximation.Meanwhile,we introduce a natural exponential cosine annealing method to make the learning rate of the neural network training process more suitable for the search procedure.Moreover,group convolution and data augmentation are employed to reduce the computational cost.Finally,through extensive experiments on several public datasets,we demonstrate that our method can more swiftly search for better-performing neural network architectures in a more efficient search space,thus validating the effectiveness of our approach.
文摘In this paper, we characterize lower semi-continuous pseudo-convex functions f : X → R ∪ {+ ∞} on convex subset of real Banach spaces K ⊂ X with respect to the pseudo-monotonicity of its Clarke-Rockafellar Sub-differential. We extend the results on the characterizations of non-smooth convex functions f : X → R ∪ {+ ∞} on convex subset of real Banach spaces K ⊂ X with respect to the monotonicity of its sub-differentials to the lower semi-continuous pseudo-convex functions on real Banach spaces.
文摘The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.
文摘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.
基金Supported by the Hi-Tech Research and Development Program of China (No. 2009AAJ130)
文摘Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.
基金National Institute of Technology Karnataka, India, for the financial support
文摘In this paper, we deal with nonlinear ill-posed problems involving m-accretive mappings in Banach spaces. We consider a derivative and inverse free method for the imple- mentation of Lavrentiev regularization method. Using general HSlder type source condition we obtain an optimal order error estimate. Also we consider the adaptive parameter choice strategy proposed by Pereverzev and Schock (2005) for choosing the regularization parameter.
基金supported by the National Natural Science Foundation of China(11701422).
文摘There is little work concerning the properties of quaternionic operators acting on slice regular function spaces defined on quaternions.In this paper,we present an equivalent characterization for the boundedness of the product operator C_(φ)D^(m) acting on Bloch-type spaces of slice regular functions.After that,an equivalent estimation for its essential norm is established,which can imply several existing results on holomorphic spaces.
基金Project supported by the Natural Science Foundation of Sichuan Province of China(No.2005A132)
文摘Some strong convergence theorems of explicit composite iteration scheme for nonexpansive semi-groups in the framework of Banach spaces are established. Results presented in the paper not only extend and improve the corresponding results of ShiojiTakahashi, Suzuki, Xu and Aleyner-Reich, but also give a partially affirmative answer to the open questions raised by Suzuki and Xu.
文摘In this paper, we show the existence and regularity of mild solutions depending on the small initial data in Besov spaces to the fractional porous medium equation. When 1 < <em>α</em> ≤ 2, we prove global well-posedness for initial data <img src="Edit_b7b43d4c-00d8-49d6-9066-97151fb5c337.bmp" alt="" /> with 1 ≤ <em>p</em> < ∞, 1 ≤ <em>q</em> ≤ ∞, and analyticity of solutions with 1 < <em>p</em> < ∞, 1 ≤ <em>q</em> ≤ ∞. In particular, we also proved that when <em>α</em> = 1, both <em>u</em> and <img src="Edit_a5af0853-8adc-4a08-b8a2-b9a70ea0f409.bmp" alt="" /> belong to <img src="Edit_03a932cc-aa58-4568-83ad-f16416cc7b71.bmp" alt="" />. We solve this equation through the contraction mapping method based on Littlewood-Paley theory and Fourier multiplier. Furthermore, we can get time decay estimates of global solutions in Besov spaces, which is <img src="Edit_083986e9-4e1c-4494-ac5d-a7d30a12df97.bmp" alt="" /> as <em>t</em> → ∞.
文摘Let E and F be Banach lattices. It is known that if every continuous linear operator from E into F is regular, then, under some mild assumptions on E or F, either E is lattice isomorphic to an AL-space or F is lattice isomorphic to an AM-space. Here we present a characterization on an AL-space E such that every bounded linear operator from E into a Banach lattice is regular. A counterexample is also provided, which shows that the results are unexpected even if the domain is an AL-space or the range space is an AM-space.
基金The questions were posed during B. de Pagter was visiting the Queen's University of Belfast in Spring 1997, whilst the second author stayed at Belfast
文摘In this paper we present some characterizations of Banach function spaces
文摘In this paper, we consider the regularized learning schemes based on l1-regularizer and pinball loss in a data dependent hypothesis space. The target is the error analysis for the quantile regression learning. There is no regularized condition with the kernel function, excepting continuity and boundness. The graph-based semi-supervised algorithm leads to an extra error term called manifold error. Part of new error bounds and convergence rates are exactly derived with the techniques consisting of l1-empirical covering number and boundness decomposition.
文摘In this paper we shall generalize the definition given in [1] for Lipschitz condition and contractions for functions on a non-metrizable space, besides we shall give more properties of semi-linear uniform spaces.
基金Supported by the National Natural Science Foundation of China(60772056)
文摘A new adaptive filtering principle based on capability control and semi-blind method is presented. A new semi-blind space-time equalizer based on constant modulus characteristic and structure risk minimum (SRM) criterion is also proposed. The equalizer sufficiently exploits the learning information of communication signals by using the structure information of filter itself through capability control technique. Namely, it maximizes the amount of learning information to im- prove filter tracking performance. Simulations are carried out and the result is compared with that of typical recursive least squares space-time equalizer (RLS-STE) and constant modulus semi-blind space-time equalizer ( CM-SB-STE ). The results show that, even if with insufficient training data, the SRM constant modulus semi-blind space-time equalizer (SCM-SB-STE) keeps good tracking per- formance, showing promises in mobile wireless communications.
基金Foundation item:This work is partially supported by the NNSF(10171011)of Chinathe NNSF(10571026)of Chinathe Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutes of MOE,P.R.C.
文摘Let R be a ring and I an ideal of R. A ring R is called I-semi-π--regular if R/I is π-regular and idempotents of R can be strongly lifted modulo I. Characterizations of I-semi-π-regular rings are given and relations between semi-π-regular rings and semiregular rings are explored.
文摘<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral polygons of</span><span style="font-family:Verdana;"> the same type. Tiling a plane with semi-regular polygons depends not only on the type of a semi-regular polygon, but also on its interior angles that join at a node. In relation to the interior angles, semi-regular equilateral polygons with the same or different interior angles can be joined in the nodes. Here, we shall first consider tiling a plane with semi-regular equilateral polygons with 2m-sides. The analysis is performed by determining the set of all integer solutions of the corresponding Diophantine equation in the form of <img alt="" src="Edit_c185b1c4-6b78-4af5-b1c2-4932af77bf65.png" />, where<img alt="" src="Edit_2e6548d5-3254-4005-b19e-9d49cd5d6f81.png" />are the non-negative integers which are not equal to zero at the same time, and <img alt="" src="Edit_a6dbde8a-5f3a-43d4-bc89-27dcc3057d23.png" />are the interior angles of a semi-regular equilateral polygon from the characteristic angle. It is shown that of all semi-regular equilateral polygons with 2m-sides, a plane can be tiled only with the semi-regular equilateral quadrilaterals and semi-regular equilateral hexagons. Then, the problem of tiling a plane with semi-regular equilateral quadrilaterals is analyzed in detail, and then the one with semi-regular equilateral hexagons. For these semi-regular polygons, all possible solutions of the corresponding Diophantine equations were analyzed and all nodes were determined, and then the problem for different values of characteristic elements was observed. For some of the observed cases of tiling a plane with these semi-regular polygons, some graphical presentations of tiling constructions are also given.</span> </p>