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,657 papers · 148 categories

Trend · papers per month

1122 · Jun 201919922001200920172026
24 results for forging

The study tackles forgery in machine unlearning, showing that forging is limited and can be detected.

problem Adversarial crafting of data to mimic model behavior without removing information.
method Developed a framework to analyze εε-forging sets and proved their measure decay.
result The forging set measure decays as ε(dr)/2ε^{(d-r)/2}, providing evidence against false unlearning claims.

In this paper we construct an infinite family of homotopically rigid spaces. These examples are then used as building blocks to forge highly connected rational spaces with prescribed finite group of self-homotopy equivalences. They are also exploited to provide highly connected inflexible and strongly chiral manifolds.

2017-01-13abs ↗pdf ↗

Interpool solves interoperability issues by minting, exchanging, and burning tokens within a single liquidity pool.

problem Lack of proper interoperability in blockchain use cases.
method Interpool operates as a standalone liquidity pool that mints, exchanges, and burns tokens, optimizing the order of transactions in the mempool.
result Interpool transforms front-running issues into a solution that ensures ultimate liquidity through a burning procedure, enabling trustless design.

A random forest is a popular tool for estimating probabilities in machine learning classification tasks. However, the means by which this is accomplished is unprincipled: one simply counts the fraction of trees in a forest that vote for a certain class. In this paper, we forge a connection between random forests and ke…

2018-12-14abs ↗pdf ↗

This paper investigates a class of attacks targeting the confidentiality aspect of security in Deep Reinforcement Learning (DRL) policies. Recent research have established the vulnerability of supervised machine learning models (e.g., classifiers) to model extraction attacks. Such attacks leverage the loosely-restricte…

2019-06-03abs ↗pdf ↗

Paper interprets UMAP and t-SNE as probabilistic MAP inference.

problem Understanding and interpreting UMAP and t-SNE.
method Interprets UMAP and t-SNE as MAP inference methods corresponding to a probabilistic model of the graph Laplacian.
result Shows UMAP and t-SNE can be understood as probabilistic inference methods.

Motivation: Cell-biological processes are regulated through a complex network of interactions between genes and their products. The processes, their activating conditions, and the associated transcriptional responses are often unknown. Organism-wide modeling of network activation can reveal unique and shared mechanisms…

2012-02-02abs ↗pdf ↗

Optimizes target value in stochastic black box functions.

problem Finding input to minimize expected squared error to target value.
method Derives acquisition functions for expected improvement, probability of improvement, and lower confidence bound, assuming Gaussian aleatoric effects.
result Acquisition functions can outperform classical Bayesian optimization under certain conditions.

Asynchronous methods are widely used in deep learning, but have limited theoretical justification when applied to non-convex problems. We show that running stochastic gradient descent (SGD) in an asynchronous manner can be viewed as adding a momentum-like term to the SGD iteration. Our result does not assume convexity …

2016-05-31abs ↗pdf ↗

Develops Weil bundles over \( p \)-adic manifolds for arithmetic geometry.

problem Connecting differential calculus and arithmetic geometry over \( p \)-adic fields.
method Systematic theory of Weil bundles, developing analytic structures.
result Establishes canonical analytic structures on Weil bundles and their cohomological comparison.

VQShape learns interpretable time-series representations and achieves comparable performance to specialist models.

problem Lack of interpretability in existing time-series models.
method Vector quantization of time-series data into abstracted shapes.
result VQShape achieves comparable performance to specialist models in classification tasks.

We suggest a new optimization technique for minimizing the sum i=1nfi(x)\sum_{i=1}^n f_i(x) of nn non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we …

2018-07-23abs ↗pdf ↗

Despite their tremendous success in a range of domains, deep learning systems are inherently susceptible to two types of manipulations: adversarial inputs -- maliciously crafted samples that deceive target deep neural network (DNN) models, and poisoned models -- adversely forged DNNs that misbehave on pre-defined input…

2019-11-05abs ↗pdf ↗

Transformers can emulate various algorithms by prompting, proving universality.

problem How to emulate algorithms using fixed-weight Transformers.
method Two modes of in-context algorithm emulation: task-specific and prompt-programmable. Constructing prompts that encode algorithm parameters into token representations.
result Fixed-weight Transformers can emulate a broad class of algorithms via prompts.

We use partial class memberships in soft classification to model uncertain labelling and mixtures of classes. Partial class memberships are not restricted to predictions, but may also occur in reference labels (ground truth, gold standard diagnosis) for training and validation data. Classifier performance is usually ex…

2013-01-02abs ↗pdf ↗

New framework tackles deep financial reporting bottleneck by improving hallucination and coherence.

problem Statistical smoothing trap in LLMs limits deep financial reporting quality.
method DeepNews Framework integrates information foraging, schema-guided planning, and adversarial prompting.
result DeepNews system achieves 25% acceptance rate in blind test, significantly outperforming SOTA.

This work proposes a novel method for interpolating ROMs without solving FEM models.

problem Interpolating ROMs for unseen parameter values without solving FEM models.
method Non-intrusive Space-Time POD interpolation on compact Stiefel manifolds.
result Robust ROMs derived for unseen parameter values with strong correlations to high-fidelity simulations.