MétaCan
Menu
Back to cohort
Record W2258686389 · doi:10.48550/arxiv.1503.07591

Convex Optimization approach to signals with fast varying instantaneous frequency

2015· preprint· en· W2258686389 on OpenAlexaff
Matthieu Kowalski, Adrien Meynard, Hau‐Tieng Wu

Bibliographic record

VenuearXiv (Cornell University) · 2015
Typepreprint
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsUniversity of Toronto
FundersFondation Mathématique Jacques HadamardNational Center for Theoretical Sciences
KeywordsRepresentation (politics)Time–frequency representationThresholdingTime–frequency analysisAlgorithmSIGNAL (programming language)Computer scienceConvex optimizationInstantaneous phaseRegular polygonHarmonicIdeal (ethics)Signal processingMathematical optimizationMathematicsArtificial intelligenceDigital signal processingAcoustics

Abstract

fetched live from OpenAlex

Motivated by the limitation of analyzing oscillatory signals composed of multiple components with fast-varying instantaneous frequency, we approach the time-frequency analysis problem by optimization. Based on the proposed adaptive harmonic model, the time-frequency representation of a signal is obtained by directly minimizing a functional, which involves few properties an "ideal time-frequency representation" should satisfy, for example, the signal reconstruction and concentrative time frequency representation. FISTA (Fast Iterative Shrinkage-Thresholding Algorithm) is applied to achieve an efficient numerical approximation of the functional. We coin the algorithm as {\it Time-frequency bY COnvex OptimizatioN} (Tycoon). The numerical results confirm the potential of the Tycoon algorithm.

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.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.002
Scholarly communication0.0010.001
Open science0.0010.002
Research integrity0.0010.003
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.088
GPT teacher head0.206
Teacher spread0.119 · 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 designSimulation or modeling
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

Citations4
Published2015
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicImage and Signal Denoising MethodsFrench-language works237,207