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

Trend · papers per month

1122 · Aug 201419922001200920172026
24 results for presets

A new method controls synthesizers with normalizing flows for easier exploration and creation.

problem Complexity and parameters in modern synthesizers make them hard to master.
method Formalizing synthesizer control as latent audio space mapping with VAE and NF, disentangling flows.
result Superior performance in parameter inference and audio reconstruction, disentangling major audio variations.

Distribution grids are currently challenged by frequent voltage excursions induced by intermittent solar generation. Smart inverters have been advocated as a fast-responding means to regulate voltage and minimize ohmic losses. Since optimal inverter coordination may be computationally challenging and preset local contr…

2018-07-10abs ↗pdf ↗

New method controls false discoveries in online testing with deadlines.

problem Controlling false discoveries in online hypothesis testing with decision deadlines.
method Benjamini-Hochberg-type procedure over a moving window of hypotheses with adaptive threshold parameters.
result Controls false discovery rate at every stage and adaptively chosen stopping times.

Modeling intraday dispatch for wind-battery assets to meet grid targets.

problem Meeting grid targets for wind-battery assets in an intraday context.
method Developed a mathematical model with closed-form solutions and a novel algorithm for stochastic control.
result Calibrated model to 140+ wind-battery assets in Texas, demonstrating economic benefits.

Previous work shows that adversarially robust generalization requires larger sample complexity, and the same dataset, e.g., CIFAR-10, which enables good standard accuracy may not suffice to train robust models. Since collecting new training data could be costly, we focus on better utilizing the given data by inducing t…

2019-05-25abs ↗pdf ↗

AL0\ell_0CORE tensor decomposition reduces computational cost for sparse count data.

problem Efficiently decompose sparse count data matrices.
method Probabilistic Tucker decomposition with 0\ell_0-norm constraint.
result AL0\ell_0CORE achieves similar results to full Tucker decomposition at a fraction of the cost.

We present a formulation of deep learning that aims at producing a large margin classifier. The notion of margin, minimum distance to a decision boundary, has served as the foundation of several theoretically profound and empirically successful results for both classification and regression tasks. However, most large m…

2018-03-15abs ↗pdf ↗

Flooding prevents deep networks from achieving zero training loss, improving test performance.

problem Deep networks can achieve zero training error but often have zero training loss, leading to overconfidence and poor test performance.
method Flooding prevents training loss from reaching zero by applying gradient ascent when loss is below a preset flood level.
result Flooding improves test performance and induces a double descent curve of the test loss.

Enhances LMC for log-concave sampling, reducing computational cost.

problem High computational cost of LMC for high-dimensional problems.
method Random coordinate descent (RCD) combined with variance reduction techniques (SAGA, SVRG).
result Achieves computational cost reduction compared to classical LMC, same number of iterations as LMC.

SDIFT generates full-field dynamics from sparse, irregular data.

problem Modeling and reconstructing physical dynamics from sparse, off-grid observations.
method SDIFT uses a functional Tucker model and sequential diffusion for generating full-field evolution from irregular sparse observations.
result Significant improvements in reconstruction accuracy and computational efficiency compared to state-of-the-art approaches.

Auto..gov uses RL to automate DeFi governance, improving security and profitability.

problem Manual DeFi governance is prone to human bias and financial risks.
method Auto..gov employs a deep Q-network reinforcement learning strategy for semi-automated parameter adjustments.
result Auto..gov outperforms traditional governance methods by at least 14% in terms of protocol profitability.

The paper uses a novel framework to learn option prices by imitating principal investor behavior.

problem Challenges in modeling stock price changes and decision making in equity markets.
method Non-deterministic Markov decision process, Bayesian deep neural network, reinforcement learning.
result Optimal option prices learned through imitation of principal investor behavior.

A new memory system handles non-stationary environments by self-sizing and retaining memories.

problem Non-stationary environments where memories arrive over time and must be distinguished from noise.
method A self-sizing continual associative memory that generalizes Hopfield's network, handling adaptation and novelty.
result The memory system grows to the intrinsic memory demand of the environment and retains memories without forgetting.

A new bandit problem where experiments can be interrupted if results are not promising.

problem Interruptible multi-armed bandit problem with a threshold for cumulative reward.
method Formalized survival regret, identified key components (regret and probability of ruin), derived lower bounds and optimal policies.
result No policy can achieve sublinear survival regret, but optimal policies minimize survival regret in a Pareto sense.