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

113225338450 · Jun 202019922001200920172026
48 results for valid inputs

MINs learn inverse mappings for high-dimensional optimization problems.

problem Data-driven optimization with high-dimensional inputs and valid subsets.
method Model Inversion Networks (MINs) learn an inverse mapping from scores to inputs.
result MINs can scale to high-dimensional input spaces and handle both offline and active data.

We analyze the adversarial examples problem in terms of a model's fault tolerance with respect to its input. Whereas previous work focuses on arbitrarily strict threat models, i.e., εε-perturbations, we consider arbitrary valid inputs and propose an information-based characteristic for evaluating tolerance to diverse …

2018-11-30abs ↗pdf ↗

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.

The paper proposes a method to detect and filter noisy or mislabeled data using pointwise mutual information.

problem Detecting and filtering noisy or mislabeled data in deep learning models.
method A mutual information-based framework quantifying statistical dependencies between inputs and labels.
result The method effectively filters low-quality samples, improving classification accuracy by up to 15%.

Study tests if input gradients highlight discriminative features, finds they often fail.

problem Validity of assumption that input gradients highlight discriminative features in model predictions.
method Developed DiffROAR framework and BlockMNIST dataset to test assumption on four benchmarks.
result Input gradients of standard models often fail to highlight discriminative features, while robust models do.

One basic requirement of many studies is the necessity of classifying data. Clustering is a proposed method for summarizing networks. Clustering methods can be divided into two categories named model-based approaches and algorithmic approaches. Since the most of clustering methods depend on their input parameters, it i…

2013-02-16abs ↗pdf ↗

An intriguing property of deep neural networks is their inherent vulnerability to adversarial inputs, which significantly hinders their application in security-critical domains. Most existing detection methods attempt to use carefully engineered patterns to distinguish adversarial inputs from their genuine counterparts…

2017-12-02abs ↗pdf ↗

LLMs fail to match statistical ground truth despite stable run-to-run performance.

problem LLMs lack validation against statistical ground truth in automated scientific workflows.
method Introduced a behavioral evaluation framework for LLMs, separating four decision-making dimensions.
result LLMs can exhibit near-perfect stability but diverge from statistical ground truth.

We propose a novel approach for loss reserving based on deep neural networks. The approach allows for joint modeling of paid losses and claims outstanding, and incorporation of heterogeneous inputs. We validate the models on loss reserving data across lines of business, and show that they improve on the predictive accu…

2018-04-24abs ↗pdf ↗

A new method builds sparse polynomial chaos expansions for models with dependent inputs.

problem Quantifying uncertainty in models with dependent inputs.
method Data-driven approach to construct orthonormal polynomials recursively based on input correlations.
result Reduces the number of observations and improves numerical stability and computational efficiency.

FuncNN package enables deep learning with functional covariates.

problem Lack of software for deep learning with functional covariates.
method Developed an R package using keras architecture, introducing functions for model building, predictions, and cross-validation.
result First package for deep learning with functional covariates.

This paper develops a framework for training and evaluating neural networks for MPC.

problem Lack of a general framework for characterizing learning approaches in MPC.
method Developed a framework using PyTorch and CVXPY, incorporating hit-and-run sampling for efficient training data generation.
result Proposed metrics for validating neural network-based MPC approaches.

Reliability is a critical consideration to DL-based systems. But the statistical nature of DL makes it quite vulnerable to invalid inputs, i.e., those cases that are not considered in the training phase of a DL model. This paper proposes to perform data sanity check to identify invalid inputs, so as to enhance the reli…

2019-09-06abs ↗pdf ↗

This study revisits UQ validation methods based on consistency and adaptivity concepts.

problem Lack of comprehensive validation methods for UQ metrics across input feature ranges.
method Revisit and extend common validation methods for UQ metrics based on consistency and adaptivity concepts.
result Improved understanding and capabilities of UQ metrics validation methods.

Techniques for understanding the functioning of complex machine learning models are becoming increasingly popular, not only to improve the validation process, but also to extract new insights about the data via exploratory analysis. Though a large class of such tools currently exists, most assume that predictions are p…

2018-10-31abs ↗pdf ↗

Theory proposes neural networks can be initialized for optimal information transmission.

problem Optimizing neural networks for optimal information transmission and representation.
method Developed a corrected mean-field framework to study neural networks as information channels, proving mutual information maximization at dynamic isometry.
result Mutual information maximization is realized between inputs and propagated signals when neural networks are initialized at dynamic isometry.

Improved code translation by preserving structure with composed fine-tuning.

problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.

We present an approach for reconfiguration of dynamic visual sensor networks with deep reinforcement learning (RL). Our RL agent uses a modified asynchronous advantage actor-critic framework and the recently proposed Relational Network module at the foundation of its network architecture. To address the issue of sample…

2018-08-13abs ↗pdf ↗

This paper introduces NPR, a technique to improve Bayesian inference for multi-modal, high-dimensional simulations.

problem Challenges in Bayesian inference for multi-modal, high-dimensional simulations.
method Introduces Neural Posterior Regularization (NPR) to enforce exploration of input parameter space.
result Empirically validated that NPR significantly improves performance on various simulation tasks.

WE constructs GP kernels for mixed inputs using weighted EDMs.

problem Limitation of standard GP models in handling categorical variables.
method WEGP constructs kernel function using weighted EDMs for categorical inputs.
result WEGP improves GP model accuracy in both synthetic and real-world optimization problems.

SOCP uses SOM to find groups and local calibration buffers for better regional coverage.

problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.

CLUE method interprets uncertainty from BNNs by showing how inputs change to increase confidence.

problem Lack of work on interpreting uncertainty estimates from probabilistic models.
method CLUE method uses counterfactual explanations to interpret uncertainty from BNNs.
result CLUE outperforms baselines and helps practitioners understand predictive uncertainty.

ManifoldShap improves model explanations by restricting evaluations to the data manifold.

problem Inaccurate and misleading model explanations due to reliance on out-of-distribution data.
method Restricts model evaluations to the data manifold to avoid off-manifold perturbations.
result ManifoldShap provides more accurate and intuitive explanations than existing methods.

CoLT assesses neural posterior estimates by detecting discrepancies across conditioning inputs.

problem Validating neural posterior estimates from limited data.
method Conditional Localization Test (CoLT) learns a localization function to detect strong deviations.
result CoLT provides rigorous guarantees and practical scalability for comparing true and neural posterior distributions.

Constraint-based learning reduces the burden of collecting labels by having users specify general properties of structured outputs, such as constraints imposed by physical laws. We propose a novel framework for simultaneously learning these constraints and using them for supervision, bypassing the difficulty of using d…

2018-05-27abs ↗pdf ↗

Multi-SpaCE generates valid counterfactual explanations for multivariate time series data.

problem Lack of transparency in deep learning models for multivariate time series data.
method Multi-objective counterfactual explanation method using NSGA-II for multivariate time series data.
result Ensures perfect validity and superior performance compared to existing methods.

The paper evaluates different graph input representations for urban network analysis.

problem Challenges in analyzing urban networks due to their size and complexity.
method Design and evaluation of six graph input representations considering topological and temporal characteristics.
result Temporal information in graph input representations significantly improves model accuracy (RMSE of 1.42).

Random deep neural networks are robust to adversarial examples, scaling with input size and dimension.

problem Adversarial examples challenge the reliability of deep learning algorithms.
method Analysis of random deep neural networks with Gaussian process equivalence and experiments on MNIST and CIFAR10.
result The p\ell^p distance of adversarial examples scales as 1/dimesp1/\sqrt{d} imes \ell^p norm of the input.

Proposes a framework to incorporate global sensitivity into local surrogate models.

problem Narrowing focus to local scale in surrogate modeling leads to re-learning global trends.
method Integrates global sensitivity analysis into local surrogate models through input warping.
result Local models become equally sensitive to all input directions, focusing on local dynamics.

Adversarial validation detects concept drift in user targeting systems.

problem Concept drift in user targeting automation systems deteriorates model performance over time.
method Adversarial validation approach to detect and adapt to concept drift.
result Adversarial validation effectively addresses concept drift in user targeting systems.

Monotonic improvement in uncertainty estimation with Gaussian processes as dimension increases.

problem Uncertainty quantification in machine learning models, especially with Gaussian processes, is challenging and poorly understood.
method Analyzing the behavior of marginal likelihood and cross-validation metrics as input dimension increases, and exploring the effects of cold posteriors.
result The marginal likelihood improves monotonically with input dimension, while cross-validation metrics exhibit double descent behavior.

Reservoir Computing (RC) provides an efficient way for designing dynamical recurrent neural models. While training is restricted to a simple output component, the recurrent connections are left untrained after initialization, subject to stability constraints specified by the Echo State Property (ESP). Literature condit…

2018-11-27abs ↗pdf ↗

It has recently been shown that neural networks but also other classifiers are vulnerable to so called adversarial attacks e.g. in object recognition an almost non-perceivable change of the image changes the decision of the classifier. Relatively fast heuristics have been proposed to produce these adversarial inputs bu…

2018-11-28abs ↗pdf ↗

Conformal prediction is a technique for constructing prediction intervals that attain valid coverage in finite samples, without making distributional assumptions. Despite this appeal, existing conformal methods can be unnecessarily conservative because they form intervals of constant or weakly varying length across the…

2019-05-08abs ↗pdf ↗

Fairness is a critical trait in decision making. As machine-learning models are increasingly being used in sensitive application domains (e.g. education and employment) for decision making, it is crucial that the decisions computed by such models are free of unintended bias. But how can we automatically validate the fa…

2018-07-02abs ↗pdf ↗

New approach links machine learning reliability to epistemic uncertainty.

problem Characterize and quantify reliability of machine learning predictions.
method Extend JTB theory to neural networks, linking prediction reliability to support characteristics.
result Demonstrates reliability for individual predictions and identifies regions of uncertainty.