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

336598130 · Jun 202019922001200920172026
48 results for ad hoc prevention

SCQRNN prevents quantile crossing and improves computational efficiency.

problem Quantile crossing issue in regression models.
method Integrates ad hoc sorting in training to prevent quantile crossing and enhance computational efficiency.
result SCQRNN achieves faster convergence and non-intersecting quantiles.

AHEAD improves financial market efficiency through ad-hoc auctions.

problem Improving financial market efficiency and reducing transaction costs.
method Introducing a new matching design (AHEAD) for electronic markets where participants can trade at a fixed price and trigger auctions when unsatisfied.
result A Nash equilibrium is achieved in the market, and ad-hoc auctions are more relevant and efficient than periodic auctions and continuous limit order books.

New approach for open ad hoc teamwork using graph-based policy learning.

problem Designing autonomous agents to collaborate with changing teams without prior coordination.
method Graph-based policy learning to adapt to dynamic team compositions.
result Successfully models the effects of other agents, leading to robust adaptation and superior performance.

FCDD improves image anomaly detection without post-hoc explainers.

problem Image anomaly detection, especially pixel-wise.
method Fully Convolutional Data Description (FCDD) directly addresses anomaly detection without post-hoc methods.
result FCDD achieves state-of-the-art results on pixel-wise AD tasks.

Boosting variational inference (BVI) approximates an intractable probability density by iteratively building up a mixture of simple component distributions one at a time, using techniques from sparse convex optimization to provide both computational scalability and approximation error guarantees. But the guarantees hav…

2019-06-04abs ↗pdf ↗

Post-hoc transforms can reverse model performance trends, especially in noisy settings.

problem Post-hoc transforms can reverse model performance trends, especially in noisy settings.
method Empirical study and analysis of post-hoc transforms like temperature scaling, ensembling, and SWA.
result Post-hoc reversal can prevent double descent and mitigate mismatches between test loss and test error.

Machine learning suffers from poor design, data, and evaluation practices.

problem Ad hoc design, poor data hygiene, and lack of statistical rigor in model evaluation.
method Examines the entire machine learning process from design to evaluation, highlighting common pitfalls and providing recommendations.
result Common pitfalls in machine learning research and development are identified and actionable recommendations are provided.

Adapts agent strategies on-the-fly for better cross-play in cooperative settings.

problem Cross-play issues between self-play agents and unseen partners.
method Adapts agent strategies using posterior belief updates via Gibbs sampling.
result Achieves strong cross-play in the Hanabi game without prior knowledge of partners' strategies.

CollaQ improves multi-agent performance in StarCraft by 40% with fewer samples.

problem Limited generalization and high training rounds in multi-agent reinforcement learning.
method Formulates multi-agent collaboration as joint optimization on reward assignment, decomposes Q-function into self and interactive terms, and uses MARA loss.
result Improves win rate by 40% in StarCraft maps with same number of samples compared to state-of-the-art techniques.

Powerful generative models, particularly in Natural Language Modelling, are commonly trained by maximizing a variational lower bound on the data log likelihood. These models often suffer from poor use of their latent variable, with ad-hoc annealing factors used to encourage retention of information in the latent variab…

2018-06-12abs ↗pdf ↗

A new framework improves tensor completion accuracy by considering numerical priors.

problem Tensor completion accuracy loss due to ignoring numerical priors.
method Generalized CP Decomposition Tensor Completion (GCDTC) framework incorporating numerical priors.
result GCDTC framework outperforms state-of-the-arts in non-negative tensor completion.

iConViz helps banks manage default contagion risk in networked loans.

problem Managing default contagion risk in networked loans during economic downturns.
method Developed iConViz, an interactive tool, and a novel metric (contagion effect) to quantify and analyze the risk.
result iConViz facilitates closed-loop analysis and helps avoid ad hoc methods.

Post-hoc calibration of neural networks using g-Layers proves theoretical justification.

problem Ensuring the confidence of neural network decisions in real-world applications.
method Proves theoretical justification for post-hoc calibration methods by adding g-Layers and minimizing NLL.
result Proves that adding g-Layers and minimizing NLL can lead to a calibrated network.

Enhances functional classifier performance with new tree-based methods and unbiased feature importance assessment.

problem Challenges of high-dimensional functional data and biased feature importance assessment.
method Augmented functional classification trees and random forests with ad-hoc conditional permutations for unbiased feature importance.
result Significant enhancement in predictive power of functional classifiers through new feature importance assessment.

FoSR adds edges to graphs to prevent oversquashing and oversmoothing in GNNs.

problem Oversquashing and oversmoothing in graph neural networks (GNNs).
method First-order spectral rewiring to add edges based on spectral expansion, combined with a relational architecture.
result Our algorithm outperforms existing graph rewiring methods in graph classification tasks.

The Epps effect helps distinguish between continuous and discrete financial tick data.

problem Determining whether financial tick data represents continuous or discrete events.
method Deriving and correcting the Epps effect, proposing experiments to discriminate between models.
result Tick data is better represented as discrete events rather than continuous Brownian diffusions.

We consider normal almost contact structures on a Riemannian manifold and, through their associated sections of an ad-hoc twistor bundle, study their harmonicity, as sections or as maps. We rewrite these harmonicity equations in terms of the Riemann curvature tensor and find conditions relating the harmonicity of the a…

2011-09-09abs ↗pdf ↗

There are several (mathematical) reasons why Dupire's formula fails in the non-diffusion setting. And yet, in practice, ad-hoc preconditioning of the option data works reasonably well. In this note we attempt to explain why. In particular, we propose a regularization procedure of the option data so that Dupire's local …

2013-02-22abs ↗pdf ↗

Method prevents model divergence in rapidly changing ad markets.

problem Model divergence due to rapid ad turnover and discontinuity.
method Dual ascent optimization with latent vector constraints.
result Significant reduction in diverging instances and improved user experience/revenue.

Enhances deep neural networks with fixed-mean Gaussian processes for uncertainty estimation.

problem Post-hoc uncertainty estimation of pre-trained deep neural networks.
method Fixed-mean Gaussian processes with variational inference for efficient stochastic optimization.
result FMGP improves uncertainty estimation and computational efficiency compared to state-of-the-art methods.

According to theoretical models of valuing risky corporate securities, risk of default is primary component in overall yield spread. However, sizable empirical literature considers it otherwise by giving more importance to non-default risk factors. Current study empirically attempts to provide relative solution to this…

2013-03-14abs ↗pdf ↗

Proposes TgNN-LD to improve neural network effectiveness and efficiency.

problem Limits in maintaining tradeoff between data and domain knowledge.
method Converts loss function to constrained form with PDEs, ECs, and EK as constraints, incorporating Lagrangian variables for equitable tradeoff.
result Improves prediction accuracy and conserves resources.

Automates kernel discovery for longitudinal data analysis.

problem Handling irregularly sampled, sparse longitudinal data with multilevel correlation.
method Combines deep neural networks and non-parametric kernel methods to discover complex multilevel correlation structure.
result Significantly outperforms state-of-the-art methods on benchmark data sets.

Regression-via-Classification (RvC) is the process of converting a regression problem to a classification one. Current approaches for RvC use ad-hoc discretization strategies and are suboptimal. We propose a neural regression tree model for RvC. In this model, we employ a joint optimization framework where we learn opt…

2018-10-01abs ↗pdf ↗

Shape information is of great importance in many applications. For example, the oil-bearing capacity of sand bodies, the subterranean remnants of ancient rivers, is related to their cross-sectional shapes. The analysis of these shapes is therefore of some interest, but current classifications are simplistic and ad hoc.…

2018-02-26abs ↗pdf ↗

A new OOD detection method OTOD uses optimal transport theory to improve model performance.

problem Detecting unknown samples in real-world machine learning models.
method OTOD uses optimal transport theory to calculate an OOD score combining features, logits, and softmax probability space.
result OTOD outperforms state-of-the-art methods by significant margins on benchmarks.

Most of the prior work on multi-agent reinforcement learning (MARL) achieves optimal collaboration by directly controlling the agents to maximize a common reward. In this paper, we aim to address this from a different angle. In particular, we consider scenarios where there are self-interested agents (i.e., worker agent…

2018-09-29abs ↗pdf ↗

Families of objects appear in several contexts, like algebraic topology, theory of deformations, theoretical physics, etc. An unified coordinate-free algebraic framework for families of geometrical quantities is presented here, which allows one to work without introducing ad hoc spaces, by using the language of differe…

2013-02-08abs ↗pdf ↗

The Epstein-Baer theory of curve isotopies is basic to the remarkable theorem that homotopic homeomorphisms of surfaces are isotopic. The groundbreaking work of R. Baer was carried out on closed, orientable surfaces and extended by D. B. A. Epstein to arbitrary surfaces, compact or not, with or without boundary and ori…

2013-05-07abs ↗pdf ↗

Differentially private learning on real-world data poses challenges for standard machine learning practice: privacy guarantees are difficult to interpret, hyperparameter tuning on private data reduces the privacy budget, and ad-hoc privacy attacks are often required to test model privacy. We introduce three tools to ma…

2018-12-07abs ↗pdf ↗

Bayesian method improves adaptive testing item selection, ensuring full item exposure.

problem Adaptive testing selects items to estimate ability, but must also ensure diverse item exposure.
method Formulated as Bayesian model averaging, deriving optimal item sampling probabilities.
result Stochastic method achieves full item bank exposure without sacrificing accuracy.

Paper presents a multi-label topic model for financial texts with high performance and insights into market reactions.

problem Analyzing financial text data for market reactions and understanding topic interactions.
method Trained a multi-label topic model on a financial text database, achieved high macro F1 score, and investigated topic interactions.
result Model achieves high performance (macro F1 > 85%) and reveals significant market reactions to topic co-occurrences.

The problem of devising learning strategies for discrete losses (e.g., multilabeling, ranking) is currently addressed with methods and theoretical analyses ad-hoc for each loss. In this paper we study a least-squares framework to systematically design learning algorithms for discrete losses, with quantitative character…

2018-10-16abs ↗pdf ↗

CRC improves multivariate forecasting accuracy without risking performance degradation.

problem Systematic errors and lack of guarantees in multivariate forecasters.
method CRC uses a causality-inspired encoder and hybrid corrector with a safety mechanism.
result CRC consistently improves accuracy and ensures high non-degradation rates.