MétaCan
Menu
Back to cohort
Record W4233258680 · doi:10.23952/jano.1.2019.2.07

Best approximation, optimal recovery, and Landau inequalities for derivatives of Hukuhara-type in function L-spaces

2019· article· en· W4233258680 on OpenAlexvenueno aff
В. Ф. Бабенко, Vira Babenko

Bibliographic record

VenueJournal of Applied and Numerical Optimization · 2019
Typearticle
Languageen
FieldMathematics
TopicApproximation Theory and Sequence Spaces
Canadian institutionsnot available
Fundersnot available
KeywordsType (biology)MathematicsFunction (biology)InequalityApplied mathematicsPure mathematicsMathematical analysisBiology

Abstract

fetched live from OpenAlex

We consider the problem of approximation of unbounded positively homogeneous operators in L-spaces using Lipschitz operators.We study its connection to the problem of computing modulus of continuity of the unbounded operator on the class of elements, as well as, to the problem of optimal recovery of an unbounded operator by a Lipschitz one on the class of elements given with an error.Moreover, in L-spaces and for positively homogeneous operators, the connection of the above-mentioned problems with inequalities of Landau -Kolmogorov type is studied.As applications, we consider the problem of approximation of unbounded operator, that for functions with values in some L-space puts in a correspondence Hukuhara-type derivatives, by Lipschitz operators.In addition, we compute the modulus of continuity of this operator and obtain exact Landau-Kolmogorov type inequalities.Further, we solve the problem of the optimal recovery of this operator on the class of functions that have Hukuhara-type derivative with the given majorant of the modulus of continuity (in the case of optimal recovery, elements of this class are given with an error).

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.017
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.017
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0020.001
Science and technology studies0.0010.004
Scholarly communication0.0020.005
Open science0.0020.003
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.025
GPT teacher head0.276
Teacher spread0.251 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Applied and Numerical OptimizationSame topicApproximation Theory and Sequence SpacesFrench-language works237,207