Peixin Ye

According to our database1, Peixin Ye authored at least 45 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sparse Signal Recovery via Rescaled Matching Pursuit.
Axioms, May, 2024

2023
A multi-point collaborative DDoS defense mechanism for IIoT environment.
Digit. Commun. Networks, April, 2023

Efficiency of Orthogonal Matching Pursuit for Group Sparse Recovery.
Axioms, April, 2023

Optimality of the rescaled pure greedy learning algorithms.
Int. J. Wavelets Multiresolution Inf. Process., March, 2023

Approximation Properties of the Blending-Type Bernstein-Durrmeyer Operators.
Axioms, January, 2023

2022
Unified error estimate for weak biorthogonal Greedy algorithms.
Int. J. Wavelets Multiresolution Inf. Process., 2022

Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms.
Axioms, 2022

Almost Optimality of the Orthogonal Super Greedy Algorithm for μ-Coherent Dictionaries.
Axioms, 2022

2021
Efficiency of the weak Rescaled Pure Greedy Algorithm.
Int. J. Wavelets Multiresolution Inf. Process., 2021

2020
Randomized approximation numbers on Besov classes with mixed smoothness.
Int. J. Wavelets Multiresolution Inf. Process., 2020

Error analysis of the moving least-squares regression learning algorithm with β-mixing and non-identical sampling.
Int. J. Comput. Math., 2020

2019
Error analysis of the moving least-squares method with non-identical sampling.
Int. J. Comput. Math., 2019

2018
Coefficient-based lq-regularized regression with indefinite kernels and unbounded sampling.
J. Approx. Theory, 2018

Convergence Rate for l<sup>q</sup>-Coefficient Regularized Regression With Non-i.i.d. Sampling.
IEEE Access, 2018

Error Analysis of Least-Squares l<sup>q</sup>-Regularized Regression Learning Algorithm With the Non-Identical and Dependent Samples.
IEEE Access, 2018

2017
The improved learning rate for regularized regression with RKBSs.
Int. J. Mach. Learn. Cybern., 2017

Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries.
Int. J. Wavelets Multiresolution Inf. Process., 2017

2016
Coefficient-based regularized regression with dependent and unbounded sampling.
Int. J. Wavelets Multiresolution Inf. Process., 2016

2015
The efficiency of using Orthogonal Matching Pursuit in compressed sensing.
J. Comput. Methods Sci. Eng., 2015

Improved bounds on restricted isometry constant for orthogonal multi matching pursuit.
J. Comput. Methods Sci. Eng., 2015

Convergence rate of semi-supervised gradient learning algorithms.
Int. J. Wavelets Multiresolution Inf. Process., 2015

2014
Strong Convex Loss Can Increase the Learning Rates of Online Learning.
J. Comput., 2014

2013
Optimal error for Orthogonal Matching Pursuit for μ-coherent dictionaries.
Proceedings of the Ninth International Conference on Natural Computation, 2013

2012
Learning Rates of Support Vector Machine Classifiers with Data Dependent Hypothesis Spaces.
J. Comput., 2012

Optimal order of truncation and aliasing errors for multi-dimensional Whittaker-Shannon sampling expansion.
Int. J. Wirel. Mob. Comput., 2012

2011
Inverse Estimates for Lupas-Baskakov Operators.
J. Comput., 2011

Least Square Regression Learning with Data Dependent Hypothesis and Coefficient Regularzation.
J. Comput., 2011

Greedy approximation with regard to non-greedy bases.
Adv. Comput. Math., 2011

Quadrature formula for some classes of analytic functions.
Proceedings of the International Conference on Electronic and Mechanical Engineering and Information Technology, 2011

2010
Monte Carlo integration with small random bits.
Proceedings of the Sixth International Conference on Natural Computation, 2010

Convergence rate of quantum algorithm for multivariate approximation.
Proceedings of the Sixth International Conference on Natural Computation, 2010

2008
Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms.
J. Approx. Theory, 2008

Complexity of Functional Learning on Some Classes of Multivariate Functions.
Proceedings of the Fourth International Conference on Natural Computation, 2008

Quantum Complexity of the Approximation on the Classes B(Wrp([0, 1]d)) and B(Hrp([0, 1]d)).
Proceedings of the Fourth International Conference on Natural Computation, 2008

Lower Bound for Quantum Integration Error on Some Sobolev Classes.
Proceedings of the Fourth International Conference on Natural Computation, 2008

An Adaptive Algorithm in m-Term Approximation for Some Multivariate Functions.
Proceedings of the International Conference on Computer Science and Software Engineering, 2008

Restricted Monte Carlo Integration on Some Multivariate Functions.
Proceedings of the International Conference on Computer Science and Software Engineering, 2008

Quantum Approximation on Some Classes of Multivarite Functions.
Proceedings of the International Conference on Computer Science and Software Engineering, 2008

2007
An Greedy-type Algorithm in m-term Approximation For Besov Class with Mixed Smoothness.
Proceedings of the Third International Conference on Natural Computation, 2007

Quantum Approximation Error on Some Sobolev Classes.
Proceedings of the Third International Conference on Natural Computation, 2007

Quantum Integration Error on Some Classes of Multivariate Functions.
Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, 2007

2006
Quantum Integration Error for Some Sobolev Classes.
Proceedings of the Advances in Natural Computation, Second International Conference, 2006

2005
Computational complexity of the integration problem for anisotropic classes.
Adv. Comput. Math., 2005

2003
Integration error for multivariate functions from anisotropic classes .
J. Complex., 2003

Probabilistic and average linear widths of Sobolev space with Gaussian measure.
J. Complex., 2003


  Loading...