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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for model freshness

Paper optimizes UAV navigation for IoT data freshness and energy efficiency.

problem Improving data freshness and connectivity for IoT devices with UAVs.
method Deep reinforcement learning model with experience replay for energy-efficient UAV trajectory optimization.
result The proposed approach is 3.6% and 3.13% more energy efficient than greedy and baseline methods.

FRESH combines patient-level and aggregate-level data for better clinical decision making.

problem Combining patient-level and aggregate-level data for clinical decision making.
method FRESH method that re-calibrates a patient-level model to match specified aggregate statistics.
result Unified data-efficient model for clinical decision making.

The study prevents model collapse in overparameterized linear regression by mixing real and synthetic labels.

problem Preventing model collapse in overparameterized linear regression.
method Iterative mixing of real and synthetic labels, deriving generalization error formulae.
result Optimal mixing ratio converges to the reciprocal of the golden ratio for isotropic features.

Contrary to the situation with stochastic gradient descent, we argue that when using stochastic methods with variance reduction, such as SDCA, SAG or SVRG, as well as their variants, it could be beneficial to reuse previously used samples instead of fresh samples, even when fresh samples are available. We demonstrate t…

2016-02-05abs ↗pdf ↗

FreSh shifts model's initial frequency spectrum to match target signal, improving neural representation performance.

problem MLPs' low-frequency bias limits capturing high-frequency details accurately.
method FreSh selects embedding hyperparameters to align model's initial output spectrum with target signal's spectrum.
result FreSh improves performance across various neural representation methods and tasks with minimal computational overhead.

Study shows how transformers classify symbols without naming them, proving a margin-versus-collision criterion.

problem How transformers classify symbols without naming them.
method Logistic classification analysis of transformer-kernel regime, colored collision graph.
result Decomposes learned predictor into ideal template-level classifier and finite-sample perturbation.

The paper analyzes how synthetic data training degrades diffusion models, providing bounds and characterizing different drift regimes.

problem The degradation of performance in diffusion models trained on synthetic data.
method Theoretical analysis of score-based diffusion models, focusing on the accumulated divergence between generated and target distributions.
result Upper and lower bounds on the accumulated divergence, providing the first lower bound for diffusion models.

We study a few basic properties of Banach-Lie groupoids and algebroids, adapting some classical results on finite dimensional Lie groupoids. As an illustration of the general theory, we show that the notion of locally transitive Banach-Lie groupoid sheds fresh light on earlier research on some infinite-dimensional mani…

2018-02-26abs ↗pdf ↗

This paper tackles task offloading in edge computing systems with dynamic interactions.

problem Dynamic interactions among mobile users in an edge computing system.
method Modelled as a non-cooperative stochastic game, transformed into a Markov decision process, and solved using online deep reinforcement learning.
result The proposed deep RL scheme balances age of information and energy consumption.

We develop original models to study interacting agents in financial markets and in social networks. Within these models randomness is vital as a form of shock or news that decays with time. Agents learn from their observations and learning ability to interpret news or private information in time-varying networks. Under…

2019-04-17abs ↗pdf ↗

We give a fresh introduction to the Khovanov Homology theory for knots and links, with special emphasis on its extension to tangles, cobordisms and 2-knots. By staying within a world of topological pictures a little longer than in other articles on the subject, the required extension becomes essentially tautological. A…

2004-10-22abs ↗pdf ↗

We extend to the nn-dimensional case a recent theorem establishing the validity of the Huygens' envelope principle for wavefronts in Finsler spaces. Our results have direct applications in analogue gravity models, for which the Fermat's principle of least time naturally gives origin to an underlying Finslerian geometr…

2019-01-04abs ↗pdf ↗

Inspired by the Finn-Osserman (1964), Chern (1969), do Carmo-Peng (1979) proofs of the Bernstein theorem, which characterizes flat planes as the only entire minimal graphs, we prove a new rigidity theorem for associate families connecting the doubly periodic Scherk graphs and the singly periodic Scherk towers. Our char…

2018-12-04abs ↗pdf ↗

Two modified tests improve the reliability of evaluating explanation methods.

problem Methodological concerns in evaluating explanation methods for saliency maps.
method Proposed modifications to the Model Parameter Randomisation Test (MPRT): Smooth MPRT and Efficient MPRT.
result Enhanced metric reliability, facilitating more trustworthy deployment of explanation methods.

Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of quantum circuits can be more challenging compared to classical neural net…

2018-08-10abs ↗pdf ↗

Boltzmann machines are physics informed generative models with wide applications in machine learning. They can learn the probability distribution from an input dataset and generate new samples accordingly. Applying them back to physics, the Boltzmann machines are ideal recommender systems to accelerate Monte Carlo simu…

2017-02-28abs ↗pdf ↗

We introduce an sl(n) homology theory for knots and links in the thickened annulus. To do so, we first give a fresh perspective on sutured annular Khovanov homology, showing that its definition follows naturally from trace decategorifications of enhanced sl(2) foams and categorified quantum gl(m), via classical skew Ho…

2015-06-26abs ↗pdf ↗

We present a primal-dual algorithmic framework to obtain approximate solutions to a prototypical constrained convex optimization problem, and rigorously characterize how common structural assumptions affect the numerical efficiency. Our main analysis technique provides a fresh perspective on Nesterov's excessive gap te…

2014-06-20abs ↗pdf ↗

Space debris warnings follow a predictable pattern, allowing timely satellite maneuvers.

problem Estimating when fresh information about space debris will arrive.
method Statistical learning model of the message arrival process, specifically a Bayesian Poisson process.
result The average prediction error for the next message arrival time is smaller than baseline predictions.

In-Run Data Shapley offers efficient data attribution for large-scale models.

problem Existing data attribution methods are computationally intensive and cannot target specific models.
method In-Run Data Shapley, which efficiently attributes data contributions to a specific model without re-training.
result In-Run Data Shapley achieves significant efficiency, enabling data attribution for pretraining models.

New method combines model forecasts and real-time observations for hourly wind speed predictions.

problem Filling the six-hour gap between weather model runs for accurate hourly wind speed forecasts.
method Combines quasi-real-time observed wind speed and weather model predictions using a novel Ensemble Model Output Statistics (EMOS) strategy.
result Successfully improved wind speed predictions compared to observed data from SYNOP stations.

We consider the sequential Bayesian optimization problem with bandit feedback, adopting a formulation that allows for the reward function to vary with time. We model the reward function using a Gaussian process whose evolution obeys a simple Markov model. We introduce two natural extensions of the classical Gaussian pr…

2016-01-25abs ↗pdf ↗