MétaCan
Menu
Back to cohort
Record W2969079918 · doi:10.1190/segam2019-3215465.1

Robust singular spectrum analysis via the bifactored gradient descent algorithm

2019· article· en· W2969079918 on OpenAlexaff
Breno Bahia, Mauricio D. Sacchi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicStatistical and numerical algorithms
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsSingular spectrum analysisAlgorithmComputer scienceGradient descentSpectrum (functional analysis)MathematicsArtificial intelligenceSingular value decompositionPhysics

Abstract

fetched live from OpenAlex

Several rank-reduction techniques have been proposed to simultaneously denoise and reconstruct seismic datasets. We reformulate the Singular Spectrum Analysis (SSA) filter as a convex optimization problem constraining the associated Hankel matrix to be of low-rank. The Hankel matrix is written as the product of two matrices of lower dimension, which are obtained using a gradient descent algorithm, called the bifactored gradient descent (BFGD). The BFGD is an efficient nonconvex method which can be easily adaptable to include sampling operators within robust measures as cost functions, thus simultaneously handling missing traces and erratic noise. We evaluate the BFGD-based SSA in the simultaneous reconstruction and denoising of a 3D field dataset and compare it with the MSSA interpolation method. The results support that the BFGD does have a competitive performance for seismic data processing applications. Presentation Date: Monday, September 16, 2019 Session Start Time: 1:50 PM Presentation Start Time: 3:05 PM Location: Poster Station 13 Presentation Type: Poster

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.001
metaresearch head score (Gemma)0.003
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.035
GPT teacher head0.263
Teacher spread0.228 · 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
GenreMethods

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

Citations5
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicStatistical and numerical algorithmsFrench-language works237,207