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

117234351468 · Jun 202019922001200920172026
48 results for severe scenarios

Risk measures such as Expected Shortfall (ES) and Value-at-Risk (VaR) have been prominent in banking regulation and financial risk management. Motivated by practical considerations in the assessment and management of risks, including tractability, scenario relevance and robustness, we consider theoretical properties of…

2018-08-22abs ↗pdf ↗

Paper investigates learnability of OOD detection under various conditions.

problem Learnability of OOD detection under different scenarios.
method Investigates PAC learning theory, proves impossibility theorems, and provides necessary and sufficient conditions.
result Some conditions for learnability of OOD detection may not hold in practical scenarios.

Generalized statistical arbitrage concepts are introduced corresponding to trading strategies which yield positive gains on average in a class of scenarios rather than almost surely. The relevant scenarios or market states are specified via an information system given by a σσ-algebra and so this notion contains classi…

2019-07-22abs ↗pdf ↗

Expectiles were defined using a minimisation principle. They form a special class of coherent risk measures. We will describe the scenario set and we will show that there is a most severe commonotonic risk measure that is smaller than the given expectile.

2013-07-22abs ↗pdf ↗

Paper introduces a benchmark for predicting bankruptcy from text data.

problem Lack of a common benchmark dataset and evaluation strategy for unstructured data in bankruptcy prediction.
method Describes and evaluates several baseline models, including a bag-of-words model.
result A lightweight bag-of-words model performs surprisingly well, especially when considering data from multiple years.

Unified framework for tractable inference scenarios in machine learning models.

problem Complex inference scenarios in machine learning models.
method Characterization of tractable modular operations over circuits and derivation of a unified framework.
result Unified framework for reasoning about tractable models.

By treating the financial market as a thermodynamic system, we establish a one-to-one correspondence between thermodynamic variables and economic quantities. Measured by the expected loss under the worst-case scenario, financial risk caused by model uncertainty is regarded as a result of the interaction between financi…

2019-03-30abs ↗pdf ↗

FavMac maximizes value while controlling cost in multi-label prediction.

problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.

In binary classification, there are situations where negative (N) data are too diverse to be fully labeled and we often resort to positive-unlabeled (PU) learning in these scenarios. However, collecting a non-representative N set that contains only a small portion of all possible N data can often be much easier in prac…

2018-10-01abs ↗pdf ↗

New method tackles rugged optimization landscapes in contact-rich scenarios.

problem Optimization challenges in dynamic environments with deformable objects.
method Combines Bayesian optimization with semi-local 'leaps' for global search.
result Outperforms gradient-based and gradient-free baselines in simulation and real robot experiments.

Paper proposes MCC to reduce class confusion for versatile DA.

problem Class confusion in DA methods limits their performance across different scenarios.
method Introduces Minimum Class Confusion (MCC) loss function to handle various DA scenarios.
result MCC significantly improves performance on diverse DA scenarios, including Multi-Source and Multi-Target DA.

A new method predicts true classes from positive and unlabeled data with additional labeled observations.

problem Predicting true classes from positive and unlabeled data with selection bias.
method Introduces augmented PU prediction, allowing feature-dependent labeling, and compares various empirical Bayes rules.
result The variational autoencoder-based method performs similarly or better than other methods and improves accuracy for unlabeled samples.

By interpreting a traffic scene as a graph of interacting vehicles, we gain a flexible abstract representation which allows us to apply Graph Neural Network (GNN) models for traffic prediction. These naturally take interaction between traffic participants into account while being computationally efficient and providing…

2019-03-04abs ↗pdf ↗

This paper surveys fairness notions in ML and recommends the most suitable one for real-world scenarios.

problem Ensuring ML systems do not discriminate against specific individuals or sub-populations.
method Identifying fairness-related characteristics of real-world scenarios and analyzing the behavior of fairness notions.
result A decision diagram to recommend the most suitable fairness notion for specific setups.

The paper explores how macroeconomic variables' correlation structure changes over time and under different scenarios.

problem Understanding the changing correlation structure of macroeconomic variables.
method The paper uses a principal component based algorithm to perform unsupervised clustering on macroeconomic variables.
result The correlation structure of macroeconomic variables changes significantly during financial crises and under hypothetical scenarios.

Adversarial attack methods have demonstrated the fragility of deep neural networks. Their imperceptible perturbations are frequently able fool classifiers into potentially dangerous misclassifications. We propose a novel way to interpret adversarial perturbations in terms of the effective input signal that classifiers …

2018-03-21abs ↗pdf ↗

The family of image visibility graphs (IVGs) have been recently introduced as simple algorithms by which scalar fields can be mapped into graphs. Here we explore the usefulness of such operator in the scenario of image processing and image classification. We demonstrate that the link architecture of the image visibilit…

2018-04-19abs ↗pdf ↗

Under the Basel II standards, the Operational Risk (OpRisk) advanced measurement approach is not prescriptive regarding the class of statistical model utilised to undertake capital estimation. It has however become well accepted to utlise a Loss Distributional Approach (LDA) paradigm to model the individual OpRisk loss…

2011-02-17abs ↗pdf ↗

Flexible evidential deep learning improves uncertainty quantification in machine learning.

problem Overconfident predictions in machine learning models can lead to serious consequences.
method Proposes flexible evidential deep learning (F-EDL) to model uncertainty over class probabilities using a flexible Dirichlet distribution.
result Empirically demonstrates state-of-the-art uncertainty quantification performance across diverse scenarios.

In this paper we provide an integral representation of the fractional Laplace-Beltrami operator for general riemannian manifolds which has several interesting applications. We give two different proofs, in two different scenarios, of essentially the same result. One of them deals with compact manifolds with or without …

2017-04-20abs ↗pdf ↗

Proposes a constraint for deep clustering to handle both simple and complex topologies.

problem Limited prior knowledge for deep clustering methods to perform well on complex topologies.
method Introduces a constraint using symmetric InfoNCE to enhance deep clustering performance.
result The constraint improves deep clustering methods' performance on both simple and complex topologies.

In recent years, pattern analysis plays an important role in data mining and recognition, and many variants have been proposed to handle complicated scenarios. In the literature, it has been quite familiar with high dimensionality of data samples, but either such characteristics or large data have become usual sense in…

2018-10-09abs ↗pdf ↗

Backdoor attacks are possible in feature-partitioned collaborative learning, even without labels.

problem Backdoor attacks in feature-partitioned collaborative learning.
method Demonstrated the feasibility of backdoor attacks and introduced defense techniques.
result Backdoor attacks can be blocked without significantly affecting main task accuracy.

Paper models non-maturing deposits using a Lévy-driven Ornstein-Uhlenbeck process.

problem Managing non-maturing deposits as a major funding source for banks.
method Develops a multivariate Lévy-driven Ornstein-Uhlenbeck process with three sources of randomness.
result Models rare but severe events in deposit volumes with positive probability.

Recent progress in the field of reinforcement learning has been accelerated by virtual learning environments such as video games, where novel algorithms and ideas can be quickly tested in a safe and reproducible manner. We introduce the Google Research Football Environment, a new reinforcement learning environment wher…

2019-07-25abs ↗pdf ↗

Develops methods for AI self-assessment to improve trustworthiness.

problem Uncertainty in AI predictions and lack of trust in AI systems.
method Uncertainty estimation techniques considering practical impacts and costs.
result Guidelines for selecting and designing effective AI self-assessment methods.

In this article, we analyze the SPICE method developed in [1], and establish its connections with other standard sparse estimation methods such as the Lasso and the LAD-Lasso. This result positions SPICE as a computationally efficient technique for the calculation of Lasso-type estimators. Conversely, this connection i…

2012-09-21abs ↗pdf ↗

RegFlow models future states with flexible probability distributions.

problem Predicting future states under complex, non-deterministic scenarios.
method Hypernetwork architecture and continuous normalizing flow model.
result RegFlow achieves state-of-the-art results on benchmark datasets.

Many machine learning techniques have been proposed in the last few years to process data represented in graph-structured form. Graphs can be used to model several scenarios, from molecules and materials to RNA secondary structures. Several kernel functions have been defined on graphs that coupled with kernelized learn…

2018-11-16abs ↗pdf ↗

New method uses weak labels to create valid confidence sets for predictions.

problem Lack of labeled data in machine learning models.
method Developed a conformal prediction framework to provide valid predictive confidence sets using weakly labeled data.
result New coverage definition allows for tighter and more informative (but valid) confidence sets.

A new method for online multi-label stream classification.

problem Challenges in classifying continuous data streams with concept drift and delayed labels.
method Online unsupervised incremental method based on self-organizing maps.
result The method is highly competitive in both stationary and concept drift scenarios.