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

54109163217 · Jun 202019922001200920172026
48 results for flexible precision

Flexible deep learning models for dynamic accuracy and speed trade-offs.

problem Dynamic accuracy and speed trade-offs in real-world applications.
method Training deep neural networks with a new method allowing flexible numerical precision during inference.
result Achieved comparable accuracy to dedicated models trained at the same precision with dynamic precision settings.

Novel deep learning model improves AUC prediction for tacrolimus dosing.

problem Model misspecification in current pharmacokinetic models.
method Latent Neural-ODE for learning individualized pharmacokinetic dynamics.
result Latent ODE model outperforms standard methods in AUC prediction accuracy.

A new R package for high-dimensional regression and precision matrix estimation.

problem High-dimensional linear regression and precision matrix estimation challenges.
method flare package implements various regression methods and extensions for sparse precision matrix estimation.
result The flare package is efficient and scalable for large problems.

A new framework for adaptive behavior using reusable value profiles.

problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.

We consider the problem of learning a Gaussian variational approximation to the posterior distribution for a high-dimensional parameter, where we impose sparsity in the precision matrix to reflect appropriate conditional independence structure in the model. Incorporating sparsity in the precision matrix allows the Gaus…

2016-05-18abs ↗pdf ↗

Graph convolutional deep kernel machine learns representations for graph tasks.

problem Limited representation learning in infinite-width neural networks.
method Developed a graph convolutional deep kernel machine as an infinite-width limit.
result Representation learning improves performance for heterophilous node classification tasks.

New framework identifies strongly identifiable models from flexible generators.

problem Indeterminacies in generative models that prevent unique latent codes.
method Theoretical framework for analyzing latent variable models, excluding certain indeterminacies.
result Strong identifiability possible even with flexible nonlinear generators.

LI-ITR combines flexible ML with interpretable approximations for personalized treatment rules.

problem Combining flexibility and interpretability in personalized treatment rules.
method Uses variational autoencoders and a mixture of interpretable experts.
result Accurately recovers true local coefficients and optimal treatment strategies.

We show that the presence of a plastikstufe induces a certain degree of flexibility in contact manifolds of dimension 2n+1>3. More precisely, we prove that every Legendrian knot whose complement contains a "nice" plastikstufe can be destabilized (and, as a consequence, is loose). As an application, it follows in certai…

2012-11-16abs ↗pdf ↗

Adaptive batch sizes improve active learning efficiency and flexibility.

problem Fixed batch sizes in active learning are inefficient due to dynamic cost-speed trade-offs.
method Probabilistic Numerics framework that adaptively changes batch sizes based on integration error and precision objectives.
result Significant enhancement in learning efficiency and flexibility across various applications.

We present a training system, which can provably defend significantly larger neural networks than previously possible, including ResNet-34 and DenseNet-100. Our approach is based on differentiable abstract interpretation and introduces two novel concepts: (i) abstract layers for fine-tuning the precision and scalabilit…

2019-03-29abs ↗pdf ↗

Deep Transformed Gaussian Processes extend TGPs with variational inference for scalable multi-layer modeling.

problem Flexible modeling of complex data distributions.
method DTGPs are a multi-layer model of TGPs using variational inference for scalability.
result DTGPs achieve good scalability and performance in multiple regression datasets.

Adaptive Prespecification improves precision in randomized trials.

problem Selecting optimal covariates for precision in randomized trials.
method Adaptive Prespecification using V-fold cross-validation and influence curve-squared loss function.
result Substantial gains in precision, equivalent to 20-43% reductions in sample size for the same power.

Determinantal point processes (DPPs) offer a powerful approach to modeling diversity in many applications where the goal is to select a diverse subset. We study the problem of learning the parameters (the kernel matrix) of a DPP from labeled training data. We make two contributions. First, we show how to reparameterize…

2014-11-06abs ↗pdf ↗

The present paper proposes generalized Gaussian kernel adaptive filtering, where the kernel parameters are adaptive and data-driven. The Gaussian kernel is parametrized by a center vector and a symmetric positive definite (SPD) precision matrix, which is regarded as a generalization of the scalar width parameter. These…

2018-04-25abs ↗pdf ↗

This paper solves the convergence problem for estimating MGGD parameters with a convex formulation.

problem Establishing convergence properties for estimating MGGD parameters with unknown mean and precision matrix.
method Proposes a convex formulation with well-established convergence properties for robust estimation in noisy scenarios.
result Demonstrates improved accuracy in precision and covariance matrix estimation compared to existing methods.

The Hull-Strominger system for supersymmetric vacua of the heterotic string allows general unitary Hermitian connections with torsion and not just the Chern unitary connection. Solutions on unimodular Lie groups exploiting this flexibility were found by T. Fei and S.T. Yau. The Anomaly flow is a flow whose stationary p…

2017-05-27abs ↗pdf ↗

A new method models individual survival curves using conditional normalizing flows.

problem Precise per-individual predictions in survival analysis.
method Conditional normalizing flows for flexible and individualized survival distributions.
result Efficient estimation of individual survival curves without overfitting.

Diffusion models adapt to low-dimensional data regardless of coefficient choices.

problem Understanding how diffusion models adapt to low-dimensional data structures.
method Analysis of diffusion models with flexible coefficient choices.
result Proven that O~(k/ε)\widetilde{O}(k/\varepsilon) iterations suffice for accurate sampling in total variation distance.

Many open problems and important theorems in low-dimensional topology have been formulated as statements about certain 2--complexes called gropes. This paper describes a precise correspondence between embedded gropes in 4--manifolds and the failure of the Whitney move in terms of iterated `towers' of Whitney disks. The…

2003-10-20abs ↗pdf ↗

Today, despite decades of developments in medicine and the growing interest in precision healthcare, vast majority of diagnoses happen once patients begin to show noticeable signs of illness. Early indication and detection of diseases, however, can provide patients and carers with the chance of early intervention, bett…

2019-07-22abs ↗pdf ↗

Study increasing profits in a flexible financial market model.

problem Characterize increasing profits in a 1D diffusion market with interest rates.
method Characterize increasing profits using an auxiliary deterministic signed measure and a canonical trading strategy.
result Existence and characterization of increasing profits in terms of νν and θθ.

The paper proposes a method to estimate treatment effects using CAR designs with additional covariates.

problem Estimating distributional treatment effects in CAR designs with additional covariates.
method Flexible distribution regression framework that incorporates additional covariates using machine learning methods.
result The proposed estimator attains the semiparametric efficiency bound for distributional treatment effects under CAR.

Deep neural network improves cancer mutation calls with confidence.

problem Improving accuracy and confidence in somatic variant calls from cancer sequencing.
method Deep Bayesian Recurrent Neural Network (RNN) with flexible priors.
result Enhanced confidence in mutation calls without performance degradation.

Bayesian method learns graph structures from Gaussian data efficiently.

problem Scalability issue in Bayesian Gaussian graphical model inference.
method Marginal pseudo-likelihood, birth-death and reversible jump MCMC algorithms.
result Efficient graph structure learning for large graphs with over 1,000 nodes.

Stein-Encoder isolates genetic signals in multi-modal biomedical data.

problem Integration of high-dimensional genomic data with clinical data obscures genetic predictive impact.
method White-box supervised framework using Stein's method and residualization.
result Stein-Encoder improves predictive accuracy and reveals specific biological mechanisms.

This paper improves fraud prevention rule sets in fintech by generating diverse rules and finding Pareto-optimal subsets.

problem Improving the quality and flexibility of fraud prevention rule sets in fintech.
method Introducing SpectralRules for generating diverse rules, and PORS for finding Pareto-optimal subsets.
result SpectralRules generates diverse rules that improve the quality of final rule subsets.

We develop a scalable method for Bayesian neural networks with stochastic differential equations.

problem Uncertainty quantification in deep neural networks.
method Gradient-based stochastic variational inference in continuous-depth Bayesian neural networks.
result Gradient estimator with zero variance as the approximation improves.

This paper tackles multi-modal label disentanglement in partition-based XMC.

problem Existing partition-based XMC methods create mutually exclusive clusters, which is sub-optimal for multi-modal labels.
method Formulates label assignment as an optimization problem to maximize precision rates, creating flexible and overlapped label clusters.
result Successfully disentangles multi-modal labels, leading to state-of-the-art results on XMC benchmarks.

Sentiment analysis consists of evaluating opinions or statements from the analysis of text. Among the methods used to estimate the degree in which a text expresses a given sentiment, are those based on Gaussian Processes. However, traditional Gaussian Processes methods use a predefined kernel with hyperparameters that …

2019-04-01abs ↗pdf ↗

Paper extends Bayes Theorem for interval probability estimates.

problem Real-world input probabilities are often interval estimates, not precise.
method Developed IT2 version of Bayes Theorem and a novel algorithm for encoding intervals.
result Conservative method avoids invalid output results from inconsistent input.

Algorithm compresses large matrices by approximating them as low rank and low precision factors.

problem Efficiently storing and processing large matrices with billions of elements.
method Randomized sketching and quantization of matrix columns to achieve low rank and low precision factorization.
result Achieves compression ratios as low as one bit per matrix coordinate while maintaining or improving performance.

Unified and simplified signature method for multivariate time series.

problem Challenging application of signature method due to its flexibility.
method Generalised signature method unifying various techniques.
result Competitive performance against benchmarks for multivariate time series classification.

In this paper we define and study flexible links and flexible isotopy in projective space. Flexible links are meant to capture the topological properties of real algebraic links. We classify all flexible links up to flexible isotopy using Ekholms interpretation of Viros encomplexed writhe.

2012-12-15abs ↗pdf ↗

The authors characterize flexibility in power and energy markets considering time, spatiality, resource, and risk.

problem Evaluating and maximizing flexibility in power systems and markets.
method Characterization of flexibility dimensions (time, spatiality, resource, risk) and their interrelations with flexibility assets, products, and services.
result Flexibility should be evaluated based on multiple dimensions for efficient power systems and markets.

GENOT matches cells across data modalities using neural OT solvers.

problem Scalability, privacy, and out-of-sample estimation issues in traditional OT solvers.
method Learn stochastic maps, parameterize OT maps, relax mass conservation, integrate quadratic solvers.
result Demonstrates significant potential for enhancing therapeutic strategies.

A new copula model for multi-attribute data using optimal transport.

problem Relaxing the Gaussian assumption for multi-attribute graphical models.
method Introducing a new copula (Cyclically Monotone Copula) and using optimal transport theory.
result The model allows arbitrary continuous distributions and is more flexible than classical methods.