We study the problem of identifying the top arms in a multi-armed bandit game. Our proposed solution relies on a new algorithm based on successive rejects of the seemingly bad arms, and successive accepts of the good ones. This algorithmic contribution allows to tackle other multiple identifications settings that w…
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
48 results for “Successive Acceptance”
Cactus improves auto-regressive decoding speed without sacrificing quality.
problem Accelerating auto-regressive decoding while maintaining output quality.
method Formalizes speculative sampling as constrained optimization and proposes Cactus for controlled divergence from the verifier distribution.
result Empirically validated effectiveness across various benchmarks.
The paper develops a theory for speculative decoding acceptance criteria.
problem Speculative decoding's acceptance criteria and their rejection regions.
method Characterization of rejection regions as lower level sets of the target distribution, derivation of exact and margin-based certificates.
result Relaxed and tree-based acceptance criteria substantially enlarge the region of certified acceptance.
Feedforward neural networks with random hidden nodes suffer from a problem with the generation of random weights and biases as these are difficult to set optimally to obtain a good projection space. Typically, random parameters are drawn from an interval which is fixed before or adapted during the learning process. Due…
New algorithm finds high-reward combinatorial sets with fewest pulls.
problem Finding high-reward combinatorial sets with unknown individual arm rewards.
method Successive acceptance and elimination based on combinatorial structure.
result Algorithm requires minimal combinatorial oracle calls, making it practical for large problems.
New star-shaped acceptability indexes generalize existing methods.
problem Generalizing existing acceptability measures.
method Characterizing acceptability indexes through star-shaped risk measures and sets.
result Introducing concrete examples linked to various financial measures.
A new method predicts student skill success rates in real-time.
problem Accurate and explainable prediction of student skill success rates in real-time.
method Performance Distribution Tracing (PDT) using a Dynamic Bayesian Network with continuous random variables.
result PDT provides both explainability and accuracy in real-time predictions of student skill success rates.
Studies acceptable bundles on a partially punctured polydisk.
problem Understanding acceptable bundles in Simpson--Mochizuki theory.
method Expository study with new arguments.
result New arguments differ from Mochizuki's.
Objective: Predict patient-specific vitals deemed medically acceptable for discharge from a pediatric intensive care unit (ICU). Design: The means of each patient's hr, sbp and dbp measurements between their medical and physical discharge from the ICU were computed as a proxy for their physiologically acceptable state …
Study on acceptable bundles on a punctured disk.
problem Understanding acceptable bundles in Simpson--Mochizuki theory.
method Detailed study and introduction of a new invariant.
result Arguments differ from Simpson and Mochizuki's.
Simple conditions for comonotonic additive risk measures from acceptance sets.
problem Conditions for comonotonic additive risk measures from acceptance sets.
method Conditions on acceptance sets for induced comonotonic additive risk measures.
result Acceptance sets induce comonotonic additive risk measures if and only if the acceptance sets and their complements are stable under convex combinations of comonotonic random variables.
In this paper we present a theoretical framework for studying coherent acceptability indices in a dynamic setup. We study dynamic coherent acceptability indices and dynamic coherent risk measures, and we establish a duality between them. We derive a representation theorem for dynamic coherent risk measures in terms of …
Paper predicts embryo implantation probability from IVF time-lapse imaging.
problem Manual embryo selection in IVF has low success rates.
method Data-driven system trained on time-lapse imaging videos.
result Algorithm improves positive and negative predictive values.
Designing agent-based market modelscond-mat.dis-nn
In light of the growing interest in agent-based market models, we bring together several earlier works in which we considered the topic of self-consistent market modelling. Building upon the binary game structure of Challet and Zhang, we discuss generalizations of the strategy reward scheme such that the agents seek to…
Proposes new deviation measures using Minkowski gauges.
problem Lack of suitable acceptance sets for deviation measures.
method Derives deviation measures through Minkowski gauges of acceptable sets.
result Any positive homogeneous deviation measure can be accommodated in the framework.
Improves algorithmic recourse to guide towards both acceptance and improvement.
problem Algorithmic recourse recommendations may not lead to improvement.
method Improvement-Focused Causal Recourse (ICR) requires recommendations to guide towards improvement and leverages causal knowledge to design accurate decision systems.
result ICR guides towards both acceptance and improvement given correct causal knowledge.
Deep learning as represented by the artificial deep neural networks (DNNs) has achieved great success in many important areas that deal with text, images, videos, graphs, and so on. However, the black-box nature of DNNs has become one of the primary obstacles for their wide acceptance in mission-critical applications s…
Acceptability maximizationq-fin.MF
The paper studies optimal investment using acceptability indices to maximize portfolio performance.
problem Optimal investment problem using coherent acceptability indices.
method Numerical algorithm approximating the original problem, dynamic coherent risk measures, set-valued Bellman's principle.
result Acceptability maximization problem reduces to a one-period problem under certain conditions.
Estimates boundaries for acceptable bilateral gamma risk in financial markets.
problem Determining the compensation needed for risky future cash flows to be considered acceptable.
method Statistical inference from market prices and derivatives, using prospect theory.
result Upper and lower boundaries for bilateral gamma risk are estimated and tested against market data.
Bayesian Dark Knowledge is a method for compressing the posterior predictive distribution of a neural network model into a more compact form. Specifically, the method attempts to compress a Monte Carlo approximation to the parameter posterior into a single network representing the posterior predictive distribution. Fur…
Study reveals bias in machine learning conference reviews.
problem Bias in machine learning conference review process.
method Comprehensive analysis of ICLR papers from 2017-2020.
result Strong institutional bias in accept/reject decisions.
Generative Adversarial Networks (GANs) have obtained extraordinary success in the generation of realistic images, a domain where a lower pixel-level accuracy is acceptable. We study the problem, not yet tackled in the literature, of generating semantic images starting from a prior distribution. Intuitively this problem…
Star-Shaped deviationsq-fin.RM
Introduces Star-Shaped deviation measures for risk analysis.
problem Risk measurement and analysis in finance.
method Characterizes Star-Shaped deviation measures through acceptance sets and convex deviation measures.
result Exposes the relationship between Star-Shaped risk measures and deviation measures.
We consider a trader who wants to direct his portfolio towards a set of acceptable wealths given by a convex risk measure. We propose a black-box algorithm, whose inputs are the joint law of stock prices and the convex risk measure, and whose outputs are the numerical values of initial capital requirement and the funct…
Study financial contracts pricing in markets with nonproportional costs and constraints.
problem Financial contract pricing in markets with nonproportional transaction costs and portfolio constraints.
method Direct and dual characterization of market-consistent prices with acceptable risk thresholds.
result Extension of the Fundamental Theorem of Asset Pricing to include good deals and scalable good deals.
Model uses Preisach hysteresis to predict gig worker acceptance, reducing costs and improving fill rates.
problem Predicting and optimizing gig worker acceptance in labor markets.
method Preisach hysteresis model applied to neural network and XGBoost classifier for binary transaction outcomes.
result Model reduces total wage bill by 21.3% and increases expected fill rate by 9.7 pp.
A collection of the accepted abstracts for the Machine Learning for Health (ML4H) workshop at NeurIPS 2019. This index is not complete, as some accepted abstracts chose to opt-out of inclusion.
Optimizes a portfolio for an investor preferring accepted securities over a reference security.
problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.
We establish dual representations for systemic risk measures based on acceptance sets in a general setting. We deal with systemic risk measures of both "first allocate, then aggregate" and "first aggregate, then allocate" type. In both cases, we provide a detailed analysis of the corresponding systemic acceptance sets …
Acceptance Rates of Invertible Neural Networks on Electron Spectra from Near-Critical Laser-Plasmas: A Comparisonphysics.plasm-ph
INNs improve acceptance rates in electron spectra analysis.
problem Analyzing electron spectra from near-critical laser-plasmas.
method Invertible Neural Networks (INNs) for forward and inverse modeling.
result INNs significantly increase acceptance rates up to a factor of 10.
The theory of acceptance sets and their associated risk measures plays a key role in the design of capital adequacy tests. The objective of this paper is to investigate, in the context of bounded financial positions, the class of surplus-invariant acceptance sets. These are characterized by the fact that acceptability …
Research examines motivations and factors influencing retailers' payment method choices.
problem Understanding motivations and factors affecting retailers' payment method choices.
method Qualitative and quantitative analysis of various factors including regulatory constraints, merchant service providers, and demographic variables.
result Lower interchange fees and regulatory constraints make card payment adoption financially feasible for merchants.
Intrinsic risk measuresq-fin.RM
Monetary risk measures are usually interpreted as the smallest amount of external capital that must be added to a financial position to make it acceptable. We propose a new concept: intrinsic risk measures and argue that this approach provides a direct path from unacceptable positions towards the acceptance set. Intrin…
Indices of acceptability are well suited to frame the axiomatic features of many performance measures, associated to terminal random cash flows.We extend this notion to classes of càdlàg processes modelling cash flows over a fixed investment horizon.We provide a representation result for bounded paths. We suggest an ac…
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…
Paper extends ranking metrics theory for financial positions.
problem Developing a new class of functionals for evaluating financial positions.
method Axiomatic framework based on monotonicity and cash-quasiconcavity.
result Linking ranking metrics to families of acceptance sets and risk measures.
Newtonian dynamical systems which accept the normal shift on an arbitrary Riemannian manifold are considered. For them the determinating equations making the weak normality condition are derived. The expansion for the algebra of tensor fields is constructed.
Paper extends ranking metrics theory for financial positions.
problem Developing a new class of performance evaluation methods.
method Axiomatic framework based on monotonicity and cash-quasiconcavity.
result Linking ranking metrics to families of acceptance sets and risk measures.
Proposes a method to estimate acceptance regions for many classes, including new ones.
problem Lack of methods to handle new classes in set-valued classification.
method Generalized Prediction Set (GPS) approach to estimate acceptance regions.
result Achieves a good balance between accuracy, efficiency, and anomaly detection.
The risk of financial positions is measured by the minimum amount of capital to raise and invest in eligible portfolios of traded assets in order to meet a prescribed acceptability constraint. We investigate nondegeneracy, finiteness and continuity properties of these risk measures with respect to multiple eligible ass…
Improved sampling for Bayesian neural networks reduces vanishing acceptance rates and increases predictive accuracy.
problem Sampling inefficiency in Bayesian neural networks, especially with deep architectures and large datasets.
method Approximate blocked Gibbs sampling to partition and sample subgroups of parameters.
result Increased predictive accuracy and quantification of predictive uncertainty in classification tasks.
We consider membership inference attacks, one of the main privacy issues in machine learning. These recently developed attacks have been proven successful in determining, with confidence better than a random guess, whether a given sample belongs to the dataset on which the attacked machine learning model was trained. S…
Boosting is one of the most successful ideas in machine learning. The most well-accepted explanations for the low generalization error of boosting algorithms such as AdaBoost stem from margin theory. The study of margins in the context of boosting algorithms was initiated by Schapire, Freund, Bartlett and Lee (1998) an…
Deep latent variable models have seen recent success in many data domains. Lossless compression is an application of these models which, despite having the potential to be highly useful, has yet to be implemented in a practical manner. We present `Bits Back with ANS' (BB-ANS), a scheme to perform lossless compression w…
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…
Monte Carlo sampling for stochastic weight functionscond-mat.stat-mech
Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the case that the weight determining the acceptance probability itself is fluctuati…
Ensuring that all supposedly valid configurations of a software product line (SPL) lead to well-formed and acceptable products is challenging since it is most of the time impractical to enumerate and test all individual products of an SPL. Machine learning classifiers have been recently used to predict the acceptabilit…
Recent developments in differentially private (DP) machine learning and DP Bayesian learning have enabled learning under strong privacy guarantees for the training data subjects. In this paper, we further extend the applicability of DP Bayesian learning by presenting the first general DP Markov chain Monte Carlo (MCMC)…