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

Trend · papers per month

491317 · Jun 202019922001200920172026
48 results for remediation

A brief historical perspective is first given concerning financial crashes, - from the 17th till the 20th century. In modern times, it seems that log periodic oscillations are found before crashes in several financial indices. The same is found in sand pile avalanches on Sierpinski gaskets. A discussion pertains to the…

2001-04-07abs ↗pdf ↗

REMEDI improves neural entropy estimation across various tasks.

problem Challenges in estimating information theoretic quantities in high-dimensional data.
method Combines minimization of cross-entropy with estimation of deviation from data density.
result Improves accuracy in entropy estimation on synthetic and natural data.

Paper presents a probabilistic diagnostic model for identifying and treating supervised learning degradation issues.

problem Degradation problems in supervised learning, including class imbalance, overlapping, small-disjuncts, noisy labels, and sparseness.
method Develops a novel probabilistic diagnostic model to identify and treat degradation issues in supervised learning.
result Early and correct diagnosis of degradation issues allows for selecting appropriate remediation treatments and unbiased performance metrics.

Nested Cavity Classifier (NCC) is a classification rule that pursues partitioning the feature space, in parallel coordinates, into convex hulls to build decision regions. It is claimed in some literatures that this geometric-based classifier is superior to many others, particularly in higher dimensions. First, we give …

2019-06-23abs ↗pdf ↗

Study on W2S generalization with spurious correlations, proposing remedies.

problem Understanding and improving W2S generalization with spurious correlations.
method Theoretical analysis and algorithmic remedies for W2S fine-tuning.
result W2S always happens with sufficient pseudolabels when group fractions match, but may fail otherwise.

We develop new techniques in the theory of convex surfaces to prove complete classification results for tight contact structures on lens spaces, solid tori, and T^2 X I. Erratum: In this note we seek to remedy errors which appeared in version 2 and were propagated in subsequent papers.

1999-10-24abs ↗pdf ↗

Every smooth fiber bundle admits a complete (Ehresmann) connection. This result appears in several references, with a proof on which we have found a gap, that does not seem possible to remedy. In this note we provide a definite proof for this fact, explain the problem with the previous one, and illustrate with examples…

2015-12-11abs ↗pdf ↗

The vector of periodic, compound returns of a typical investment portfolio is almost never a convex combination of the return vectors of the securities in the portfolio. As a result the ex post version of Harry Markowitz's "standard mean-variance portfolio selection model" does not apply to compound return data. We pro…

2011-04-28abs ↗pdf ↗

Transformers without skip connections collapse token representations to a single direction.

problem Rapid convergence of token representations to a single direction in self-attention-only Transformers.
method Analysis of layer normalization, residual connections, and multi-head attention mechanisms.
result Residual connections prevent rank collapse in real Transformers, while MLPs generate new feature directions.

Unified AI system for data quality control and governance in regulated environments.

problem Isolated data quality control steps in existing systems.
method AI-driven framework integrating rule-based, statistical, and AI methods.
result Empirical gains in anomaly detection, reduced manual remediation, improved auditability.

Despite their impressive performance in many tasks, deep neural networks often struggle at relational reasoning. This has recently been remedied with the introduction of a plug-in relational module that considers relations between pairs of objects. Unfortunately, this is combinatorially expensive. In this extended abst…

2018-11-01abs ↗pdf ↗

In retail, there are predictable yet dramatic time-dependent patterns in customer behavior, such as periodic changes in the number of visitors, or increases in customers just before major holidays. The current paradigm of multi-armed bandit analysis does not take these known patterns into account. This means that for a…

2015-05-21abs ↗pdf ↗

We study the properties of Expected Shortfall from the point of view of financial risk management. This measure --- which emerges as a natural remedy in some cases where Value at Risk (VaR) is not able to distinguish portfolios which bear different levels of risk --- is indeed shown to have much better properties than …

2001-02-16abs ↗pdf ↗

Existing feature selection methods fail to properly account for interactions between features when evaluating feature subsets. In this paper, we attempt to remedy this issue by using orthogonal variance decomposition to evaluate features. The orthogonality of the decomposition allows us to directly calculate the total …

2019-10-22abs ↗pdf ↗

Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there …

2018-02-03abs ↗pdf ↗

The paper discusses methods to compute Green's function on algebraic surfaces using Schottky uniformization.

problem Computing Green's function on algebraic surfaces using Schottky uniformization.
method Investigates convergence of deformations of a formula related to Green's function.
result Provides insights into the geometric interpretation of the formula for Green's function.

We investigate the difference between using an 1\ell_1 penalty versus an 1\ell_1 constraint in generalized eigenvalue problems, such as principal component analysis and discriminant analysis. Our main finding is that an 1\ell_1 penalty may fail to provide very sparse solutions; a severe disadvantage for variable sel…

2014-10-22abs ↗pdf ↗

This article is a response to the recent Worrying Trends in Econophysics critique written by four respected theoretical economists. Two of the four have written books and papers that provide very useful critical analyses of the shortcomings of the standard textbook economic model, neo-classical economic theory and have…

2006-06-01abs ↗pdf ↗

In recent years, Deep Learning has become the go-to solution for a broad range of applications, often outperforming state-of-the-art. However, it is important, for both theoreticians and practitioners, to gain a deeper understanding of the difficulties and limitations associated with common approaches and algorithms. W…

2017-03-23abs ↗pdf ↗

Added examples of S^1-manifolds with finite 2nd homotopy group and non-zero A-genus.

problem Constructing examples of S^1-manifolds with finite 2nd homotopy group and non-zero A-genus.
method Explicit equivariant surgeries to construct examples.
result Construction of new examples with finite 2nd homotopy group and non-zero A-genus.

It is important to develop mathematically tractable models than can interpret knowledge extracted from the data and provide reasonable predictions. In this paper, we present a Linear Distillation Learning, a simple remedy to improve the performance of linear neural networks. Our approach is based on using a linear func…

2019-06-13abs ↗pdf ↗

The amount of information in the form of features and variables avail- able to machine learning algorithms is ever increasing. This can lead to classifiers that are prone to overfitting in high dimensions, high di- mensional models do not lend themselves to interpretable results, and the CPU and memory resources necess…

2014-02-10abs ↗pdf ↗

Normalization methods are a central building block in the deep learning toolbox. They accelerate and stabilize training, while decreasing the dependence on manually tuned learning rate schedules. When learning from multi-modal distributions, the effectiveness of batch normalization (BN), arguably the most prominent nor…

2018-10-12abs ↗pdf ↗

Much of the recent work on learning molecular representations has been based on Graph Convolution Networks (GCN). These models rely on local aggregation operations and can therefore miss higher-order graph properties. To remedy this, we propose Path-Augmented Graph Transformer Networks (PAGTN) that are explicitly built…

2019-05-29abs ↗pdf ↗

Classical (Itô diffusions) stochastic volatility models are not able to capture the steepness of small-maturity implied volatility smiles. Jumps, in particular exponential Lévy and affine models, which exhibit small-maturity exploding smiles, have historically been proposed to remedy this (see \cite{Tank} for an overvi…

2015-03-27abs ↗pdf ↗

Explainable Artificial Intelligence (XAI)has received a great deal of attention recently. Explainability is being presented as a remedy for the distrust of complex and opaque models. Model agnostic methods such as LIME, SHAP, or Break Down promise instance-level interpretability for any complex machine learning model. …

2019-03-27abs ↗pdf ↗

GrowNet uses shallow neural networks for gradient boosting, outperforming existing methods.

problem Improving gradient boosting performance through shallow neural networks.
method Unified gradient boosting framework with shallow neural networks as weak learners, incorporating corrective steps.
result GrowNet outperformed state-of-the-art boosting methods in classification, regression, and learning to rank tasks.

Paper introduces a new gradient statistic to improve deep learning convergence.

problem Fluctuation effect of gradient updates between iterations.
method Introduces an unbiased stratified statistic \(\bar{G}_{mst}\) and a new algorithm MSSG.
result MSSG algorithm outperforms other sgd-like algorithms in training deep models.

Dealing with uncertainty is essential for efficient reinforcement learning. There is a growing literature on uncertainty estimation for deep learning from fixed datasets, but many of the most popular approaches are poorly-suited to sequential decision problems. Other methods, such as bootstrap sampling, have no mechani…

2018-06-08abs ↗pdf ↗

We demonstrate both analytically and numerically that the existing methods for measuring tail dependence in copulas may sometimes underestimate the extent of extreme co-movements of dependent risks and, therefore, may not always comply with the new paradigm of prudent risk management. This phenomenon holds in the conte…

2014-05-06abs ↗pdf ↗

The study aims to prevent unfair content presentation in recommender systems.

problem Over- and under-presentation of content leads to biased user preference estimates.
method Two models are considered: one that ignores systematic and limited exposure, and another that conditions on limited exposure.
result Ignoring systematic presentations overestimates promoted options and underestimates censored alternatives.

I sketch a program for a microeconomic theory of the main component of the business cycle as a recurring disequilibrium, driven by incompleteness of the financial market and by information asymmetries between borrowers and lenders. This proposal seeks to incorporate five distinct but connected processes that have been …

2013-12-02abs ↗pdf ↗