Pablo Manuel Berná
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Pablo Manuel Berná has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Miguel Berasategui
IMAS-UBA-CONICET-Pab I, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina
17 shared publications - Fernando Albiac
Department of Mathematics, Statistics and Computer Sciences, and InaMat2, Universidad Pública de Navarra, Pamplona, Spain
9 shared publications - José Luis Ansorena
Universidad de La Rioja
9 shared publications - Hung Viet Chu
Texas A&M University
8 shared publications - Oscar Blasco
Departamento de Análisis Matemático, Universidad de Valencia, Valencia, Spain
6 shared publications - Eugenio Hernández
Departamento de Matemáticas, Universidad Autónoma de Madrid, Madrid, Spain
4 shared publications
Latest Publications
- 26 October 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (3) , 86
Geometry-weighted orthogonal greedy approximation on sampled manifolds: stability, consistency, and numerical experiments
- 26 October 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (3) , 86
Geometry-weighted orthogonal greedy approximation on sampled manifolds: stability, consistency, and numerical experiments
- 8 August 2026
- Published by Springer Nature in Revista Matemática Complutense
- p. 1-31
Lebesgue-type estimates for greedy algorithms in quasi-Banach spaces
- 8 August 2026
- Published by Springer Nature in Revista Matemática Complutense
- p. 1-31
Lebesgue-type estimates for greedy algorithms in quasi-Banach spaces
- Open Access
- 12 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 967
Step-Size Decay and Structural Stagnation in Greedy Sparse Learning
Greedy algorithms are central to sparse approximation and stage-wise learning methods such as matching pursuit and boosting. It is known that the Power-Relaxed Greedy Algorithm with step sizes may fail to converge when in general Hilbert spaces. In this work, we revisit this phenomenon from a sparse learning perspective. We study realizable regression problems with controlled feature coherence and derive explicit lower bounds on the residual norm, showing that over-decaying step-size schedules induce structural stagnation even in low-dimensional sparse settings. Numerical experiments confirm the theoretical predictions and illustrate the role of feature coherence. Our results provide insight into step-size design in greedy sparse learning.- 12 March 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (6) , 967
Open AccessStep-Size Decay and Structural Stagnation in Greedy Sparse Learning
Greedy algorithms are central to sparse approximation and stage-wise learning methods such as matching pursuit and boosting. It is known that the Power-Relaxed Greedy Algorithm with step sizes may fail to converge when in general Hilbert spaces. In this work, we revisit this phenomenon from a sparse learning perspective. We study realizable regression problems with controlled feature coherence and derive explicit lower bounds on the residual norm, showing that over-decaying step-size schedules induce structural stagnation even in low-dimensional sparse settings. Numerical experiments confirm the theoretical predictions and illustrate the role of feature coherence. Our results provide insight into step-size design in greedy sparse learning. - Open Access
Convergence Analysis of Greedy Algorithms with Adaptive Relaxation in Hilbert Spaces
The Power-Relaxed Greedy Algorithm (PRGA) was introduced as a generalization of the so called Relaxed Greedy Algorithm, introduced by DeVore and Temlyakov, by replacing the relaxation parameter $1/m$ with $1/m^α$, with the aim of improving convergence rates. While the case $α\le 1$ is well understood, the behavior of the algorithm for $α>1$ remained an open problem. In this work, we answer this question and, moreover, we introduce a relaxed greedy algorithm with an optimal step size chosen by exact line search at each iteration.Open AccessConvergence Analysis of Greedy Algorithms with Adaptive Relaxation in Hilbert Spaces
The Power-Relaxed Greedy Algorithm (PRGA) was introduced as a generalization of the so called Relaxed Greedy Algorithm, introduced by DeVore and Temlyakov, by replacing the relaxation parameter $1/m$ with $1/m^α$, with the aim of improving convergence rates. While the case $α\le 1$ is well understood, the behavior of the algorithm for $α>1$ remained an open problem. In this work, we answer this question and, moreover, we introduce a relaxed greedy algorithm with an optimal step size chosen by exact line search at each iteration. - Open Access
Maximal inequalities, frames and greedy algorithms
The aim of this article is to use Banach lattice techniques to study coordinate systems in function spaces. We begin by proving that the greedy algorithm of a basis is order convergent if and only if a certain maximal inequality is satisfied. We then show that absolute frames need not admit a reconstruction algorithm with respect to the usual order convergence, but do allow for reconstruction with respect to the order convergence inherited from the double dual. After this, we investigate the extent to which such coordinate systems affect the geometry of the underlying function space. Most notably, we prove that a Banach lattice $X$ is lattice isomorphic to a closed sublattice of a $C(K)$-space if and only if every unconditional sequence in $X$ is absolute.Open AccessMaximal inequalities, frames and greedy algorithms
The aim of this article is to use Banach lattice techniques to study coordinate systems in function spaces. We begin by proving that the greedy algorithm of a basis is order convergent if and only if a certain maximal inequality is satisfied. We then show that absolute frames need not admit a reconstruction algorithm with respect to the usual order convergence, but do allow for reconstruction with respect to the order convergence inherited from the double dual. After this, we investigate the extent to which such coordinate systems affect the geometry of the underlying function space. Most notably, we prove that a Banach lattice $X$ is lattice isomorphic to a closed sublattice of a $C(K)$-space if and only if every unconditional sequence in $X$ is absolute. - Open Access
When Greedy Approximation Breaks: Counterexamples in Quasi-Banach Spaces
We construct two counterexamples that resolve long-standing open problems on greedy approximation theory with respect to bases, posed in [F. Albiac et al., Dissertationes Math. 560 (2021)] and restated in [F. Albiac, J. L. Ansorena, V. Temlyakov, J. Approx. Theory 307 (2025)]. Our first result exhibits a quasi-Banach space $\mathbb{X}$ with an almost greedy basis which, when transported to the Banach envelope of $\mathbb{X}$, ceases to be quasi-greedy. This shows that the passage to the Banach envelope, although it preserves linear and lattice structure, may radically disrupt the performance of the thresholding greedy algorithm, to the extent that in some respects it could perform better in a quasi-Banach space than in its Banach envelope. Our second result constructs an almost greedy Markushevich basis in a nonlocally convex quasi-Banach space $\mathbb{Y}$ which fails to be a Schauder basis under any reordering. Together, these examples highlight that local convexity and the Banach envelope construction play an unexpectedly active role in shaping greedy approximation phenomena, revealing structural differences between Banach and quasi-Banach spaces that go beyond the classical theory of bases.Open AccessWhen Greedy Approximation Breaks: Counterexamples in Quasi-Banach Spaces
We construct two counterexamples that resolve long-standing open problems on greedy approximation theory with respect to bases, posed in [F. Albiac et al., Dissertationes Math. 560 (2021)] and restated in [F. Albiac, J. L. Ansorena, V. Temlyakov, J. Approx. Theory 307 (2025)]. Our first result exhibits a quasi-Banach space $\mathbb{X}$ with an almost greedy basis which, when transported to the Banach envelope of $\mathbb{X}$, ceases to be quasi-greedy. This shows that the passage to the Banach envelope, although it preserves linear and lattice structure, may radically disrupt the performance of the thresholding greedy algorithm, to the extent that in some respects it could perform better in a quasi-Banach space than in its Banach envelope. Our second result constructs an almost greedy Markushevich basis in a nonlocally convex quasi-Banach space $\mathbb{Y}$ which fails to be a Schauder basis under any reordering. Together, these examples highlight that local convexity and the Banach envelope construction play an unexpectedly active role in shaping greedy approximation phenomena, revealing structural differences between Banach and quasi-Banach spaces that go beyond the classical theory of bases. - Open Access
Lebesgue-type estimates for greedy algorithms in quasi-Banach spaces
We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter for strong partially greedy bases. Second, we establish a new upper bound for the Lebesgue parameter for semi-greedy bases using the quasi-greedy and the squeeze symmetry parameters. Finally, we answer several open questions regarding the optimal power in various bounds proved in [F. Albiac, J. L. Ansorena, and P. M. Berná, New parameters and Lebesgue-type estimates in greedy approximation, Forum Math. Sigma 10 (2022), 1-39].
Open AccessLebesgue-type estimates for greedy algorithms in quasi-Banach spaces
We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter for strong partially greedy bases. Second, we establish a new upper bound for the Lebesgue parameter for semi-greedy bases using the quasi-greedy and the squeeze symmetry parameters. Finally, we answer several open questions regarding the optimal power in various bounds proved in [F. Albiac, J. L. Ansorena, and P. M. Berná, New parameters and Lebesgue-type estimates in greedy approximation, Forum Math. Sigma 10 (2022), 1-39].
- 13 May 2025
- Published by Springer Nature in Annals of Functional Analysis
- Vol. 16 (3) , 1-35
On sequential greedy-type bases
- 13 May 2025
- Published by Springer Nature in Annals of Functional Analysis
- Vol. 16 (3) , 1-35
On sequential greedy-type bases
- 20 December 2024
- Published by Springer Nature in Annals of Functional Analysis
- Vol. 16 (1) , 1-39
On approximation spaces and Greedy-type bases
- 20 December 2024
- Published by Springer Nature in Annals of Functional Analysis
- Vol. 16 (1) , 1-39
On approximation spaces and Greedy-type bases
- 3 October 2024
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 11 (4) , 1-17
On consecutive greedy and other greedy-like type of bases
- 3 October 2024
- Published by Springer Nature in Research in the Mathematical Sciences
- Vol. 11 (4) , 1-17
On consecutive greedy and other greedy-like type of bases