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

Trend · papers per month

92184275367 · Jun 202019922001200920172026
48 results for Input Comparison

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.

Novel CNN-based gaze scanpath comparison distinguishes experts from novices in dental radiograph interpretation.

problem Distinguishing expertise in dental radiograph interpretation based on gaze behavior.
method Convolutional neural networks (CNN) process scene information at the fixation level, using image patches as input to compare gaze scanpaths.
result 93% accuracy in distinguishing experts from novices using image patch features.

Two algorithms for nonlinear systems with unknown inputs are compared and implemented.

problem Analysis and comparison of algorithms for nonlinear systems with unknown inputs.
method Two symbolic algorithms, ORC-DF and FISPO, are compared and implemented in a MATLAB toolbox.
result FISPO is more generally applicable, while ORC-DF is more efficient for affine input models.

This study provides benchmarks for different implementations of LSTM units between the deep learning frameworks PyTorch, TensorFlow, Lasagne and Keras. The comparison includes cuDNN LSTMs, fused LSTM variants and less optimized, but more flexible LSTM implementations. The benchmarks reflect two typical scenarios for au…

2018-06-05abs ↗pdf ↗

In ranking problems, the goal is to learn a ranking function from labeled pairs of input points. In this paper, we consider the related comparison problem, where the label indicates which element of the pair is better, or if there is no significant difference. We cast the learning problem as a margin maximization, and …

2014-01-30abs ↗pdf ↗

Motivated by recent advance of machine learning using Deep Reinforcement Learning this paper proposes a modified architecture that produces more robust agents and speeds up the training process. Our architecture is based on Asynchronous Advantage Actor-Critic (A3C) algorithm where the total input dimensionality is halv…

2018-04-13abs ↗pdf ↗

Develops a statistical framework to measure uncertainty in model rankings based on human preferences.

problem Uncertainty in model rankings based on human preferences due to mismatch between human and model preferences.
method Statistical framework using pairwise comparisons by humans and models to provide rank-sets for each model.
result Rank-sets constructed using only pairwise comparisons by strong models often do not cover the true ranking of human preferences.

Simple GBRT model improved by window-based input transformation outperforms state-of-the-art deep learning models.

problem Improving performance of traditional forecasting models for time series data.
method Transformed GBRT model input structure to include target values and external features, forming one input instance per training window.
result Simple GBRT model with window-based input transformation outperformed state-of-the-art deep learning models on nine datasets.

We propose regularization strategies for learning discriminative models that are robust to in-class variations of the input data. We use the Wasserstein-2 geometry to capture semantically meaningful neighborhoods in the space of images, and define a corresponding input-dependent additive noise data augmentation model. …

2019-09-15abs ↗pdf ↗

Presented are two neural network architectures for convex functions, demonstrating competitive performance.

problem Approximating convex functions efficiently and accurately.
method Developed two neural network architectures: one based on linear-by-part representation and the other on cubic splines.
result Cubic ICKAN networks produce results similar to classical ICNNs in solving convex approximation problems.

Robust method estimates state, input, and parameters of linear systems online.

problem Joint estimation of state, input, and parameters in noisy or outlier-prone measurements.
method Combines recursive, alternating, and iteratively-reweighted least squares into a single algorithm.
result Good performance in presence of outliers and compared to state-of-the-art methods.

New oracle uses uncertainty for active classification with noisy feedback.

problem Improving query complexity in interactive binary classifier learning.
method Proposes a new pairwise comparison oracle that considers uncertainty and an adaptive labeling algorithm.
result Demonstrates improved performance and efficiency compared to existing methods.

A new method scales CCA parameters by input to learn more correlated representations.

problem Limitation of conventional CCA models in learning highly correlated representations.
method Introduces a dynamic scaling method for training input-dependent canonical correlation models.
result Learned representations are more correlated and retrieval results are preferable.

VAIOM models financial returns using continuous input and categorical output.

problem Modeling continuous, noisy, and heterogeneous financial data.
method VAIOM is a decoder-only Transformer that separates input representation from output likelihood.
result VAIOM models outperform fixed single-bar LightGBM baseline in both Test halves.

C-FAR automates clustering assessment for neural tracking.

problem Manual assessment of clusters by humans is slow and impractical for large datasets.
method C-FAR uses automated feedback queries to select optimal clustering from multiple algorithms.
result C-FAR produces near-perfect clustering on simulated neural data.

Enhances graph comparison by incorporating edge features using Fused Gromov-Wasserstein distance.

problem Graph distances overlook edge attributes, limiting their effectiveness.
method Introduced Fused Gromov-Wasserstein distance for graph comparison with edge features. Proposed algorithms for distance and barycenter computation.
result Empirically validated the effectiveness of the novel distance in graph learning tasks.

Review and compare model order reduction methods for process engineering.

problem Creating computationally efficient yet accurate models for real-time applications.
method Nonlinear model order reduction methods, including general-purpose and tailored approaches for chemical processes.
result Comparison of eight model order reduction methods applied to an air separation process model.

ModelDiff compares learning algorithms by identifying feature transformations.

problem Comparing models trained with different learning algorithms.
method ModelDiff uses datamodels framework to find distinguishing feature transformations.
result ModelDiff can compare models trained with/without data augmentation, pre-training, and different SGD hyperparameters.

Comparison of UQ methods in deep learning for a simple physical system.

problem Uncertainty quantification in deep learning for physical systems.
method Bayesian Neural Networks (BNN), Concrete Dropout (CD), Deep Ensembles (DE), and Analytic Error Propagation.
result Pitfalls in using UQ methods, especially Bayesian Neural Networks and Concrete Dropout.

Study compares 29 emulators across 60 test functions and 40 datasets.

problem Comparing the strengths and weaknesses of different emulators.
method Large-scale, fully reproducible comparison using R package duqling.
result Detailed empirical insights into emulator strengths and weaknesses.

Wasserstein gradient boosting predicts probability distributions for supervised learning.

problem Distribution-valued supervised learning where outputs are probability distributions.
method Fits a new weak learner to Wasserstein gradients of loss functionals of probability distributions.
result Superior performance in probabilistic prediction compared to existing methods.

For predictive maintenance, we examine one of the largest public datasets for machine failures derived along with their corresponding precursors as error rates, historical part replacements, and sensor inputs. To simplify the time and accuracy comparison between 27 different algorithms, we treat the imbalance between n…

2018-12-11abs ↗pdf ↗

A new noise model for preferential Bayesian optimization using user anchors.

problem Inadequate assumption of homoscedastic noise in human-in-the-loop settings.
method Proposes a heteroscedastic noise model with anchors and a KDE uncertainty map.
result Risk-adjusted performance improvement and clarified anchor placement effects.

In this paper, we proposed a deep learning-based end-to-end method on the domain specified automatic term extraction (ATE), it considers possible term spans within a fixed length in the sentence and predicts them whether they can be conceptual terms. In comparison with current ATE methods, the model supports nested ter…

2019-08-15abs ↗pdf ↗

A framework for quantifying uncertainty in feature importance values.

problem Stable interpretation of feature importance values in machine learning models.
method A novel method based on pairwise comparisons of feature importance values to produce confidence intervals for feature ranks.
result The method produces simultaneous confidence intervals for feature ranks, enabling selection of top-k important features.

Standard kernels such as Matérn or RBF kernels only encode simple monotonic dependencies within the input space. Spectral mixture kernels have been proposed as general-purpose, flexible kernels for learning and discovering more complicated patterns in the data. Spectral mixture kernels have recently been generalized in…

2018-11-27abs ↗pdf ↗

PSimGNN partitions graphs into subgraphs for efficient graph similarity computation.

problem Efficiently compute graph similarity scores for large graphs.
method Graph partitioning followed by subgraph-level and node-level comparisons using a graph neural network.
result PSimGNN outperforms state-of-the-art methods in graph similarity computation tasks.

ASADG improves data generation for accurate surrogate modeling of complex physical problems.

problem Training surrogate models on imbalanced data leads to inaccurate predictions.
method ASADG iteratively adds input data to improve the representation of the response manifold.
result ASADG generates more representative input data compared to LHS for better model accuracy.

Denoising autoencoders (DAEs) have proven useful for unsupervised representation learning, but a thorough theoretical understanding is still lacking of how the input noise influences learning. Here we develop theory for how noise influences learning in DAEs. By focusing on linear DAEs, we are able to derive analytic ex…

2018-06-14abs ↗pdf ↗

We present a regression technique for data-driven problems based on polynomial chaos expansion (PCE). PCE is a popular technique in the field of uncertainty quantification (UQ), where it is typically used to replace a runnable but expensive computational model subject to random inputs with an inexpensive-to-evaluate po…

2018-08-09abs ↗pdf ↗

Optimal control of stochastic nonlinear dynamical systems is a major challenge in the domain of robot learning. Given the intractability of the global control problem, state-of-the-art algorithms focus on approximate sequential optimization techniques, that heavily rely on heuristics for regularization in order to achi…

2019-10-07abs ↗pdf ↗