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.
Paper tackles regression with cost-based rejection, balancing prediction and rejection costs.
Extends clustering method to cost-based hierarchies.
A new active learning method considers both uncertainty and diversity to minimize labeling and decision costs.
PRS improves rejection sampling by learning better proposals.
We provide a method for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling with particle filtering. We also provide an approximate form of rejection sampling …
Algorithmic trading systems on DEXs reject most candidate tokens, but the counterfactual outcome of rejected candidates is rarely measured.
RMT-Net tackles biased credit scoring data by learning from both default/non-default and rejection/approval tasks.
Optimal regression with reject option using conditional variance thresholding.
In this paper we address cardinality estimation problem which is an important subproblem in query optimization. Query optimization is a part of every relational DBMS responsible for finding the best way of the execution for the given query. These ways are called plans. The execution time of different plans may differ b…
A reject option improves partial-label learning's accuracy.
Sparse RSP routing improves graph exploration and classification.
A dealer manages quotes and rejection rules to control slippage risk in FX markets.
A new approach to model rejection using density ratios.
Delayed rejection HMC improves sampling efficiency for multiscale distributions.
Credit scoring models support loan approval decisions in the financial services industry. Lenders train these models on data from previously granted credit applications, where the borrowers' repayment behavior has been observed. This approach creates sample bias. The scoring model (i.e., classifier) is trained on accep…
Paper connects rejection learning to Bhattacharyya divergence.
Credit scoring models based on accepted applications may be biased and their consequences can have a statistical and economic impact. Reject inference is the process of attempting to infer the creditworthiness status of the rejected applications. In this research, we use deep generative models to develop two new semi-s…
A method for making predictions with a reject option using conformal prediction.
We consider the problem of selective prediction (also known as reject option) in deep neural networks, and introduce SelectiveNet, a deep neural architecture with an integrated reject option. Existing rejection mechanisms are based mostly on a threshold over the prediction confidence of a pre-trained network. In contra…
A novel method for classification with rejection using ensemble of cost-sensitive classifiers.
Rejection Sampling is a fundamental Monte-Carlo method. It is used to sample from distributions admitting a probability density function which can be evaluated exactly at any given point, albeit at a high computational cost. However, without proper tuning, this technique implies a high rejection rate. Several methods h…
A method for pricing and superhedging European options under proportional transaction costs based on linear vector optimisation and geometric duality developed by Lohne & Rudloff (2014) is compared to a special case of the algorithms for American type derivatives due to Roux & Zastawniak (2014). An equivalence between …
New algorithms reduce rejection sampling complexity for shape-constrained distributions.
Proposes a method combining CNFs and rejection-resampling for sampling from unnormalized densities.
RED-2400 is a public benchmark of trading events from a Solana exchange, labeled by algorithmic rejection.
Learning with rejection (LWR) allows development of machine learning systems with the ability to discard low confidence decisions generated by a prediction model. That is, just like human experts, LWR allows machine models to abstain from generating a prediction when reliability of the prediction is expected to be low.…
We propose Generative Well-intentioned Networks (GWINs), a novel framework for increasing the accuracy of certainty-based, closed-world classifiers. A conditional generative network recovers the distribution of observations that the classifier labels correctly with high certainty. We introduce a reject option to the cl…
For several decades, the no-arbitrage (NA) condition and the martingale measures have played a major role in the financial asset's pricing theory. We propose a new approach for estimating the super-replication cost based on convex duality instead of martingale measures duality: Our prices will be expressed using Fenche…
Active learning is an important technique to reduce the number of labeled examples in supervised learning. Active learning for binary classification has been well addressed in machine learning. However, active learning of the reject option classifier remains unaddressed. In this paper, we propose novel algorithms for a…
We consider the combined use of resampling and partial rejection control in sequential Monte Carlo methods, also known as particle filters. While the variance reducing properties of rejection control are known, there has not been (to the best of our knowledge) any work on unbiased estimation of the marginal likelihood …
Generation of pseudorandom numbers from different probability distributions has been studied extensively in the Monte Carlo simulation literature. Two standard generation techniques are the acceptance-rejection and inverse transformation methods. An alternative approach to Monte Carlo simulation is the quasi-Monte Carl…
Naive approaches to amortized inference in probabilistic programs with unbounded loops can produce estimators with infinite variance. This is particularly true of importance sampling inference in programs that explicitly include rejection sampling as part of the user-programmed generative procedure. In this paper we de…
The wide and rapid adoption of deep learning by practitioners brought unintended consequences in many situations such as in the infamous case of Google Photos' racist image recognition algorithm; thus, necessitated the utilization of the quantified uncertainty for each prediction. There have been recent efforts towards…
Accelerated RPCholesky speeds up kernel matrix approximations.
Framework to mitigate adversarial attacks by allowing classifiers to abstain.
Variational inference using the reparameterization trick has enabled large-scale approximate Bayesian inference in complex probabilistic models, leveraging stochastic optimization to sidestep intractable expectations. The reparameterization trick is applicable when we can simulate a random variable by applying a differ…
Improved inference for models with continuous latent variables.
We present a method for performing Hamiltonian Monte Carlo that largely eliminates sample rejection for typical hyperparameters. In situations that would normally lead to rejection, instead a longer trajectory is computed until a new state is reached that can be accepted. This is achieved using Markov chain transitions…
Marxism's rate of profit thesis rejected as illogical.
This paper characterizes and designs loss functions for robust classification with abstention.
Generative classifiers have been shown promising to detect illegal inputs including adversarial examples and out-of-distribution samples. Supervised Deep Infomax~(SDIM) is a scalable end-to-end framework to learn generative classifiers. In this paper, we propose a modification of SDIM termed SDIM-\emph{logit}. Instead …
The study proposes a framework to accept OOD data based on competence scores.
Hour-Aware Adaptive Risk Management for Autonomous Memecoin Trading
TabNAS improves neural architecture search for tabular datasets by rejecting suboptimal architectures.
Considering a lead-time-and price-sensitive demand, we investigate whether a client rejection policy, modeled as M/M/1/K system, can be more profitable than an all-client acceptance policy, modeled as M/M/1 system. We provide analytical insights for the cases with and without holding and penalty costs by comparing M/M/…
In this paper we present a theoretical framework for determining dynamic ask and bid prices of derivatives using the theory of dynamic coherent acceptability indices in discrete time. We prove a version of the First Fundamental Theorem of Asset Pricing using the dynamic coherent risk measures. We introduce the dynamic …
We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs (DAGs), where nodes represent hypotheses and edges specify a partial ordering in which hypotheses must be tested. The procedure is guaranteed to reject a sub-DAG with bounded false discovery rate (FDR) while satisf…
We investigate the problem of multiclass classification with rejection, where a classifier can choose not to make a prediction to avoid critical misclassification. First, we consider an approach based on simultaneous training of a classifier and a rejector, which achieves the state-of-the-art performance in the binary …