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.

169,291 papers · 148 categories

Trend · papers per month

0.3%0.6%0.9%1.2% · Apr 200219922001200920182026
48 results for easy-to-use

A new ABC method simplifies Bayesian inference for complex models.

problem Computational difficulty in Bayesian inference for models without analytical likelihoods.
method Empirical likelihood ABC method that requires only summary statistics and simulation.
result The posterior obtained is consistent and performs well across various examples.

IllinoisSL is a Java library for learning structured prediction models. It supports structured Support Vector Machines and structured Perceptron. The library consists of a core learning module and several applications, which can be executed from command-lines. Documentation is provided to guide users. In Comparison to …

2015-09-23abs ↗pdf ↗

Agent-based models have demonstrated their power and flexibility in Econophysics. However their major challenge is still to devise more realistic simulation scenarios. The complexity of Economy makes appealing the idea of introducing chaotic number generators as simulation engines in these models. Chaos based number ge…

2011-10-20abs ↗pdf ↗

Approximate Incremental Value-at-Risk formulae provide an easy-to-use preliminary guideline for risk allocation. Both the cases of risk adding and risk pooling are examined and beta-based formulae achieved. Results highlight how much the conditions for adding new risky positions are stronger than those required for ris…

2002-04-28abs ↗pdf ↗

We introduce Group equivariant Convolutional Neural Networks (G-CNNs), a natural generalization of convolutional neural networks that reduces sample complexity by exploiting symmetries. G-CNNs use G-convolutions, a new type of layer that enjoys a substantially higher degree of weight sharing than regular convolution la…

2016-02-24abs ↗pdf ↗

Improves neural semantic parsers using human feedback.

problem Improving neural semantic parsers through human feedback.
method Counterfactual learning from human bandit feedback, reweighting estimator, stochastic gradient optimization.
result Significant improvement in semantic parsers achieved.

SNAP improves robust computation by emphasizing trustworthy items and downweighting outliers.

problem Improving robustness in computation, especially in high-dimensional settings.
method SNAP assigns weights based on mutual agreement, suppressing outlier contributions.
result SNAP ensures outliers contribute negligibly to computations, even in high-dimensional settings.

A new imputation method MissARF uses adversarial random forests for fast and accurate missing value imputation.

problem Handling missing values in biostatistical analyses.
method Adversarial Random Forests (ARF) for density estimation and data synthesis.
result MissARF performs comparably to state-of-the-art methods in imputation quality and runtime.

HIVE-COTE v1.0 improves time series classification with enhanced usability.

problem Improving time series classification accuracy and usability.
method Presented a walkthrough guide and extensive experimental evaluation of HIVE-COTE v1.0.
result HIVE-COTE v1.0 outperforms three recently proposed algorithms in predictive performance and resource usage.

New method improves fault detection by adding unsupervised learning to Monte Carlo dropout models.

problem Detecting and diagnosing incipient and unknown faults in deep neural networks.
method Augmenting Monte Carlo dropout models with unsupervised learning tasks.
result Improved fault detection and diagnosis performance, especially on out-of-distribution examples.

A CBR approach helps fraud analysts trust machine learning predictions.

problem Understanding the trustworthiness of machine learning predictions for fraud analysts.
method Case-based reasoning (CBR) approach to visualize similar previous instances and their local post-hoc explanations.
result Empirically, the visualization of similar previous instances is useful and easy to use for fraud analysts.

Benchmark improves object detection robustness in winter weather.

problem Assessing object detection models' performance under image corruptions.
method Developed three benchmark datasets with various image corruptions; used data augmentation to improve robustness.
result Simple data augmentation significantly enhances model robustness across different corruptions and datasets.

Robust Lasso-Zero handles missing covariates and sparse corruptions.

problem Sparse corruptions and missing covariates in sparse linear models.
method Extension of Lasso-Zero to handle sparse corruptions, with theoretical guarantees on sign recovery.
result Robust Lasso-Zero can handle missing values without specifying a parametric model.

Paper proposes transparent reporting of algorithmic energy usage to promote environmental sustainability.

problem Need for transparent reporting of algorithmic energy usage for environmental sustainability.
method Developed a Python package to make analyses of energy usage accessible to individual researchers, localized to specific power grids, and compared with global benchmarks.
result Demonstrated the use of automatically-generated Energy Usage Reports in model-choice for machine learning.

DECOMPOSE improves accuracy and robustness in blind source separation.

problem Extracting sources from large-scale data using blind source separation.
method Probabilistic blind source separation framework (DECOMPOSE) that adapts to individual sources and handles large-scale data.
result Substantial improvements in accuracy and robustness on artificial and real data.