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

Trend · papers per month

3527041,0551,407 · Jun 202019922001200920172026
48 results for routine modeling

Machine learning model diagnoses COVID-19 from routine blood tests.

problem Difficulty in diagnosing COVID-19 due to inconsistent blood parameter changes.
method Constructed a machine learning model using 5,333 patients with various infections and 160 COVID-19-positive patients.
result Cross-validated AUC of 0.97, sensitivity of 81.9%, specificity of 97.9%.

PSO optimizes model parameters in nonstandard distributions.

problem Estimating model parameters in nonstandard distributions using existing algorithms.
method Particle Swarm Optimization (PSO) as an alternative optimization routine.
result PSO produces more optimal or convergent results than existing algorithms.

Research proposes a risk-free machine learning model for COVID screening from routine blood tests.

problem Rapid antigen tests have low sensitivity and are not suitable for widespread screening.
method Stacked Ensemble Machine Learning model using routine blood tests.
result 100% accuracy, precision, recall and F1-score in identifying COVID patients.

Lung segmentation accuracy varies little across diverse datasets.

problem Limited clinical applicability of automated lung segmentation methods.
method Comparison of four deep learning approaches and two standard algorithms on diverse datasets.
result Standard U-net approach yields higher accuracy on routine imaging data.

We propose a parallelizable sparse inverse formulation Gaussian process (SpInGP) for temporal models. It uses a sparse precision GP formulation and sparse matrix routines to speed up the computations. Due to the state-space formulation used in the algorithm, the time complexity of the basic SpInGP is linear, and becaus…

2016-10-25abs ↗pdf ↗

ParaMonte::Python streamlines Bayesian data analysis with fast Monte Carlo and MCMC routines.

problem Efficiently sampling posterior distributions in Bayesian modeling and data science.
method Serial and MPI-parallelized Markov Chain Monte Carlo (MCMC) routines.
result Automated model calibration and uncertainty quantification in Bayesian analysis.

Testing the implementation of deep learning systems and their training routines is crucial to maintain a reliable code base. Modern software development employs processes, such as Continuous Integration, in which changes to the software are frequently integrated and tested. However, testing the training routines requir…

2019-01-14abs ↗pdf ↗

Meta-learning improves feature extraction for few-shot tasks.

problem Understanding why meta-learning models perform better on few-shot classification.
method Developed hypotheses and a regularizer to improve standard training routines.
result Meta-learned models outperform classical training routines in few-shot classification.

The computation of convolution layers in deep neural networks typically rely on high performance routines that trade space for time by using additional memory (either for packing purposes or required as part of the algorithm) to improve performance. The problems with such an approach are two-fold. First, these routines…

2018-09-20abs ↗pdf ↗

We consider the problem of estimating a regression function in the common situation where the number of features is small, where interpretability of the model is a high priority, and where simple linear or additive models fail to provide adequate performance. To address this problem, we present Maximum Variance Total V…

2017-08-06abs ↗pdf ↗

Sparked by Alòs, León, and Vives (2007); Fukasawa (2011, 2017); Gatheral, Jaisson, and Rosenbaum (2018), so-called rough stochastic volatility models such as the rough Bergomi model by Bayer, Friz, and Gatheral (2016) constitute the latest evolution in option price modeling. Unlike standard bivariate diffusion models s…

2018-10-08abs ↗pdf ↗

Dynamic memory prevents forgetting in continuous learning of medical images.

problem Catastrophic forgetting in machine learning models over time due to domain shifts.
method Dynamic memory to store and replay diverse training data subsets.
result Dynamic memory mitigates forgetting without knowing when shifts occur.

Global convergence for robust regression problems via IRLS with enhancements.

problem Global convergence for robust regression problems.
method Augmentations to IRLS to ensure global recovery and improved robustness.
result Global recovery guarantees for robust regression problems, outperforming state-of-the-art algorithms.

Paper optimizes GEMM for deep learning models, improving performance.

problem Limited GEMM optimization in deep learning frameworks restricts performance on different hardware.
method Proposes two novel algorithms: Greedy Best First Search (G-BFS) and Neighborhood Actor Advantage Critic (N-A2C) based on TVM framework.
result Significant performance improvements in GEMM computation time, achieving up to 40% savings.

Many real-world problems encountered in several disciplines deal with the modeling of time-series containing different underlying dynamical regimes, for which probabilistic approaches are very often employed. In this paper we describe several such approaches in the common framework of graphical models. We give a unifie…

2011-04-11abs ↗pdf ↗

Study predicts academic achievement using students' support networks.

problem Predicting academic achievement in college students.
method Decision tree and random forest algorithms applied to Ties data.
result Different types of support are important for different demographics and genders.

Optimizes CM for stochastic convex optimization with progressive precision.

problem Stochastic nature of objective function in convex optimization.
method Iterative coordinate minimization with optimal precision control.
result Order-optimal regret performance for strongly convex and nonsmooth functions.

We are in the middle of a remarkable rise in the use and capability of artificial intelligence. Much of this growth has been fueled by the success of deep learning architectures: models that map from observables to outputs via multiple layers of latent representations. These deep learning algorithms are effective tools…

2016-12-30abs ↗pdf ↗

New approach reduces shape optimization anomalies and improves design quality.

problem Improving global optimization efficiency and avoiding geometrical anomalies in shape optimization.
method Reducing design variables, modeling generative process via probabilistic models, penalizing anomalous designs.
result Abnormal designs are penalized, leading to high-quality designs and improved convergence.

Efficient EP algorithm improves smoothing distribution inference in financial models.

problem Computational intractability of smoothing distribution in high dimensions.
method Adapted expectation propagation (EP) algorithms for the unified skew-normal family.
result Accuracy gains in financial illustrations over existing approximate algorithms.

The approach that allows find European option price on the assumption of hedging at discrete times is proposed. The routine allows find the option price not for lognormal distribution functions of underlying asset only but for wide enough classes of distribution functions too. It is shown that there exists a nonzero po…

2003-09-29abs ↗pdf ↗

New method explains survival analysis models using median-SHAP.

problem Need for explainable AI in medical applications, especially for survival analysis.
method Introduces median-SHAP for explaining survival analysis models.
result Conventionally used mean anchor point can lead to misleading interpretations; median-SHAP provides a better approach.

A privacy-preserving algorithm for high-dimensional bandits.

problem High-dimensional stochastic contextual linear bandits with sparse parameters under privacy constraints.
method PrivateLASSO algorithm based on sparse hard-thresholding and episodic thresholding.
result Minimax private lower bounds and utility guarantees for PrivateLASSO.

We introduce an algebraic formula producing infinitely many exact solutions of the constant astigmatism equation zyy+(1/z)xx+2=0 z_{yy} + ({1}/{z})_{xx} + 2 = 0 from a given seed. A construction of corresponding surfaces of constant astigmatism is then a matter of routine. As a special case, we consider multisoliton solutions of t…

2015-03-23abs ↗pdf ↗