Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,932 papers · 148 categories

Trend · papers per month

0.3%0.5%0.8%0.2% · Aug 202519922001200920172026
10 results for pseudocode

Improved code translation by preserving structure with composed fine-tuning.

problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.

Given a presentation for a rack R\mathcal R, we define a process which systematically enumerates the elements of R\mathcal R. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalizes and improves the diagramming method for nn-quandles introduced by Winker. We p…

2017-07-05abs ↗pdf ↗

Develops a new framework for temporal anchoring in deep embedding spaces.

problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.

SoftAdapt dynamically adjusts loss weights for multi-part functions.

problem Slow convergence and poor weight selection for multi-part loss functions.
method SoftAdapt dynamically changes weights based on live performance statistics.
result Improved convergence and better weight selection for multi-part loss functions.

I consider unsupervised extensions of the fast stepwise linear regression algorithm \cite{efroymson1960multiple}. These extensions allow one to efficiently identify highly-representative feature variable subsets within a given set of jointly distributed variables. This in turn allows for the efficient dimensional reduc…

2017-06-10abs ↗pdf ↗

Paper presents a consistent discretization for Hodge decomposition on volumetric meshes.

problem Discretization of Hodge decomposition for vector fields on volumetric meshes.
method Edge-based Nedelec elements and face-based Crouzeix-Raviart elements interplay.
result Stable and efficient method for large-sized models with good performance.