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

4795142189 · Jun 202019922001200920172026
48 results for active intervals

Paper proves neural networks can be approximated using interval bounds.

problem Verifying safety and robustness of neural networks.
method Introduces interval universal approximation (IUA) theorem for neural networks.
result Neural networks can be approximated using interval bounds for any continuous function and squashable activation functions.

Active inference uses machine learning to prioritize data labeling for more efficient statistical inference.

problem Efficiently collecting data points for statistical inference with limited labels.
method A machine learning-assisted approach that identifies uncertain data points for labeling.
result Achieves the same level of accuracy with fewer samples, resulting in smaller confidence intervals and more powerful p-values.

FAQ efficiently evaluates LLMs with statistical guarantees using adaptive query selection.

problem Efficiently evaluating many LLMs on a large suite of benchmarks is expensive.
method FAQ uses Bayesian factor models, adaptive sampling, and proactive active inference to select queries.
result FAQ delivers up to 5x effective sample size gains over baselines, matching CI width with fewer queries.

In quantitative finance, we often model asset prices as semimartingales, with drift, diffusion and jump components. The jump activity index measures the strength of the jumps at high frequencies, and is of interest both in model selection and fitting, and in volatility estimation. In this paper, we give a novel estimat…

2014-09-29abs ↗pdf ↗

Proposes a new network for accurate predictions and uncertainty estimation.

problem Uncertainty estimation in regression predictions without sacrificing accuracy.
method Decoupled two-stage training process with custom loss function.
result Reduces prediction error by 23-34% while maintaining 95% PICP.

Paper improves confidence intervals and variance estimation for deep learning models.

problem Improving confidence intervals and variance estimation in deep learning models.
method Residual-based framework for conditional variance estimation; robust bootstrap procedure for confidence intervals.
result First non-asymptotic bounds for variance estimation using ReLU networks.

We analyze empirical data from the internet auction site Aukro.cz. The time series of activity shows truncated fractal structure on scales from about 1 minute to about 1 day. The distribution of waiting times as well as the distribution of number of auctions within fixed interval is a power law, with exponents 1.51.5 an…

2014-01-13abs ↗pdf ↗

New insights on active sequential prediction for mean estimation.

problem Active sequential prediction-powered mean estimation problem.
method Combining uncertainty-based suggestion with a constant probability, analyzing non-asymptotic bounds, and using no-regret learning.
result The optimal query probability is close to the constraint when using no-regret learning.

Universal approximation for ODENet and ResNet with a single activation function.

problem Approximating complex dynamical systems with limited vector fields.
method Examined ODENet and ResNet with vector fields composed of a single activation function and affine mapping.
result ODENet and ResNet with restricted vector fields can uniformly approximate those with general vector fields.

AskewSGD optimizes quantized neural networks with interval-constrained optimization.

problem Training deep neural networks with quantized weights.
method Formulates QNN training as smoothed interval-constrained optimization, proposes AskewSGD for solving each subproblem.
result AskewSGD avoids projections and allows infeasible iterates, performs better than state-of-the-art methods.

One dimensional stylized model taking into account spatial activity of firms with uniformly distributed customers is proposed. The spatial selling area of each firm is defined by a short interval cut out from selling space (large interval). In this representation, the firm size is directly associated with the size of i…

2007-10-02abs ↗pdf ↗

Paper proposes faster certified robust training methods with short warmup.

problem Certified robust training methods require long warmup schedules, making training costly.
method Proposes three improvements: new weight initialization, BN, and regularization.
result Achieves 65.03% verified error on CIFAR-10 and 82.36% on TinyImageNet with short warmup.

Equity activity is an essential topic for financial market studies. To explore its statistical regularities, we comprehensively examine the trading value, a measure of the equity activity, of the 3314 most-traded stocks in the U.S. equity market and find that (i) the trading values follow a log-normal distribution; (ii…

2009-11-22abs ↗pdf ↗

Market activity scales near a constant of 0.632 in intrinsic time.

problem Understanding the stability of market scaling laws.
method Modeling market directional changes as a memoryless exponential hazard process and identifying the intrinsic time scaling constant.
result The intrinsic time scaling constant is 11/e=0.6321 - 1/e = 0.632.

We study the volatility time series of 1137 most traded stocks in the US stock markets for the two-year period 2001-02 and analyze their return intervals ττ, which are time intervals between volatilities above a given threshold qq. We explore the probability density function of ττ, Pq(τ)P_q(τ), assuming a stretched exp…

2008-08-23abs ↗pdf ↗

In recent years, active subspace methods (ASMs) have become a popular means of performing subspace sensitivity analysis on black-box functions. Naively applied, however, ASMs require gradient evaluations of the target function. In the event of noisy, expensive, or stochastic simulators, evaluating gradients via finite …

2019-07-26abs ↗pdf ↗

Randomized methods of neural network learning suffer from a problem with the generation of random parameters as they are difficult to set optimally to obtain a good projection space. The standard method draws the parameters from a fixed interval which is independent of the data scope and activation function type. This …

2019-08-11abs ↗pdf ↗

Post-ADC inference corrects bias in statistical inference after active data collection.

problem Bias in inference after active data collection.
method Post-ADC inference framework that corrects bias from both ADC process and data-driven target construction.
result Valid inference for data collected by SMBO methods like GP-UCB and TPE.

Cryptocurrency market activity is decomposed into recurring and noise components, revealing patterns tied to macroeconomic reports.

problem Investigating temporal patterns of cryptocurrency market activity.
method Decomposition of market activity measures into recurring and noise components via correlation matrix formalism.
result Recurring market activity bursts coincide with significant U.S. macroeconomic reports, indicating their influence.

The paper develops methods to accurately locate change points in high-dimensional mean shift models.

problem Locating change points in high-dimensional mean shift models.
method Locally refitted least squares estimator, component-wise and simultaneous rates of estimation.
result Asymptotic validity of component-wise and simultaneous confidence intervals for change point parameters.

Study near-maturity convergence rates of American put prices in Lévy models.

problem Analyzing convergence rates of optimal exercise prices in Lévy models.
method Examined two settings: jumps of unbounded and bounded variation, deriving near-maturity expansions.
result Near-maturity convergence rate of optimal exercise price is of order √(T-t).

We consider the problem of governing systemic risk in a banking system model. The banking system model consists in an initial value problem for a system of stochastic differential equations whose dependent variables are the log-monetary reserves of the banks as functions of time. The banking system model considered gen…

2018-12-17abs ↗pdf ↗

Identifies learning rules from neural network observables.

problem Determine the underlying plasticity rules governing learning in biological systems.
method Simulated idealized neuroscience experiments with artificial neural networks to generate a dataset of learning trajectories. Used linear and non-linear classifiers to identify learning rules from aggregate statistics of weights, activations, and activity changes.
result Different classes of learning rules can be separated solely on the basis of aggregate statistics of the weights, activations, or instantaneous layer-wise activity changes.

Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins not with a training sample, but instead with resources that it can use to obtain information to help identify the optimal model. To better u…

2012-07-11abs ↗pdf ↗

Active learning method optimizes seismic fragility curve estimation.

problem Optimizing calls to complex numerical models for fragility curve estimation.
method Importance sampling based active learning for parametric seismic fragility curve estimation.
result The method optimizes the estimation of fragility curves with mathematical rigor.

dYdX updates liquidity provider incentives to enhance trading efficiency.

problem Incentivizing liquidity providers to maintain efficient market structures.
method Analyzed various metrics (makerVolume, depths, spreads) and used historical trades to update the LP Incentives Programme.
result Updated the LP Incentives Programme to encourage more active and efficient liquidity.

Neural networks trained with backpropagation often struggle to identify classes that have been observed a small number of times. In applications where most class labels are rare, such as language modelling, this can become a performance bottleneck. One potential remedy is to augment the network with a fast-learning non…

2018-03-27abs ↗pdf ↗

DABS uses a policy network to select experiments in high-dimensional design spaces.

problem Adaptive factorial screening in high-dimensional discrete design spaces.
method DABS learns a policy network offline to sequentially select experiments, incorporating sparsity and interactions via a spike-and-slab prior.
result DABS achieves superior accuracy and scalability over classical and Bayesian baselines under tight experimental budgets.