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

Trend · papers per month

22436586 · Jun 202019922001200920172026
48 results for Pandora's Box

Bayesian optimization with cost-awareness using Gittins index.

problem Optimizing unknown functions with limited data evaluations and costs.
method Developed a connection between cost-aware Bayesian optimization and the Pandora's Box problem, using the Gittins index as an acquisition function.
result The Gittins index-based acquisition function performs well in cost-aware Bayesian optimization, especially in high dimensions.

Gittins index optimizes decision-making under uncertainty, even in complex scenarios.

problem Optimal decision-making under uncertainty.
method Gittins index optimizes allocation of resources among uncertain options.
result Gittins index can be effectively applied to practical problems, including Bayesian optimization and queue latency minimization.

The paper discusses selecting predictive models for causal inference, highlighting the challenges and proposing a solution.

problem Selecting the best predictive models for causal inference from a variety of machine learning models.
method The paper proposes using RextriskR ext{-risk}, flexible estimators, and splitting data to compute risks for model selection.
result The proposed method controls both outcome errors for treated and non-treated individuals, addressing the issue of model selection for causal inference.

DE is a new exploration method that limits resource usage based on expected improvement and surprise.

problem Limited exploration in large action spaces when resources are scarce.
method Delight-gated exploration (DE) that limits exploration actions based on a gate price set by the product of expected improvement and surprise.
result DE outperforms ε\varepsilon-greedy and Thompson Sampling in terms of regret across various bandit and MDP settings.

On December 16, Zynga, the well-known social game developing company went public. This event is following other recent IPOs in the world of social networking companies, such as Groupon, Linkedin or Pandora to cite a few. With a valuation close to 7 billion USD at the time when it went public, Zynga has become the bigge…

2011-12-27abs ↗pdf ↗

ODS improves adversarial attacks by maximizing output diversity.

problem Efficiency and effectiveness of adversarial attacks, especially black-box attacks.
method Output Diversified Sampling (ODS) that maximizes diversity in model outputs.
result ODS reduces the number of queries needed for black-box attacks on ImageNet by a factor of two.

New research shows many recent defenses against adversarial examples are ineffective against black-box attacks.

problem The robustness of recent defenses against adversarial examples is insufficient, especially against black-box attacks.
method Evaluation of nine defenses on two black-box adversarial models and six attacks on CIFAR-10 and Fashion-MNIST datasets.
result Most recent defenses provide only marginal improvements in security (<25%<25\%) compared to undefended networks.

Spanning attack improves black-box attacks with unlabeled data.

problem Query inefficiency in black-box attacks due to high input space dimensionality.
method Proposes spanning attack by constraining adversarial perturbations in a low-dimensional subspace via an auxiliary unlabeled dataset.
result Significantly improves query efficiency of black-box attacks.

Watermarking of deep neural networks (DNN) can enable their tracing once released by a data owner. In this paper, we generalize white-box watermarking algorithms for DNNs, where the data owner needs white-box access to the model to extract the watermark. White-box watermarking algorithms have the advantage that they do…

2019-10-31abs ↗pdf ↗

Unified approach for sequence design combining likelihood-free inference and black-box optimization.

problem Designing biological sequences efficiently and accurately.
method Unified probabilistic framework integrating likelihood-free inference and black-box optimization.
result Previous optimization methods can be adapted and new algorithms proposed within this framework.

Transfer learning improves model robustness against adversarial attacks.

problem Understanding how transfer learning affects model robustness against adversarial attacks.
method Extensive empirical evaluations of white-box and black-box attacks on fine-tuned transfer learning models.
result Adversarial examples are more transferable when fine-tuning is used than when networks are trained independently.

Estimates box dimension of fractal interpolation surfaces using oscillation vectors.

problem Estimating the complexity of fractal interpolation surfaces.
method Defined vertical scaling matrices and used them to relate oscillation vectors of different levels.
result Obtained the box dimension of generalized affine fractal interpolation surfaces.

Two-step conformal prediction method for adaptive bounding box uncertainties in multi-object detection.

problem Quantifying predictive uncertainty for multi-object detection in safety-critical applications.
method Developed a two-step conformal prediction approach to propagate uncertainty in predicted class labels into bounding box uncertainties, ensuring coverage for incorrectly classified objects.
result Desired coverage levels are satisfied with practically tight predictive uncertainty intervals on real-world datasets.

Understanding how a learned black box works is of crucial interest for the future of Machine Learning. In this paper, we pioneer the question of the global interpretability of learned black box models that assign numerical values to symbolic sequential data. To tackle that task, we propose a spectral algorithm for the …

2018-10-12abs ↗pdf ↗

New method optimizes black-box functions using generative models and Wasserstein distance.

problem Optimizing black-box functions with stochastic responses in high dimensions.
method Deep generative surrogate models and Wasserstein distance for uncertainty estimation.
result Method outperforms state-of-the-art methods in robustness to function shape and stochasticity.

Paper proposes a new black-box attack approach to minimize visual distortion.

problem Constructing adversarial examples that minimize visual distortion in a black-box threat model.
method Learning the noise distribution of adversarial examples to approximate the gradient of a non-differentiable loss function.
result The proposed attack results in much lower visual distortion compared to state-of-the-art black-box attacks.

Extends batch active learning to non-differentiable models.

problem Efficiently training machine learning models on large, initially unlabelled datasets.
method Black-box batch active learning for regression tasks that relies solely on model predictions.
result Achieves strong performance on regression datasets compared to white-box approaches for deep learning models.

Many deployed learned models are black boxes: given input, returns output. Internal information about the model, such as the architecture, optimisation procedure, or training data, is not disclosed explicitly as it might contain proprietary information or make the system more vulnerable. This work shows that such attri…

2017-11-06abs ↗pdf ↗

Adapts model-based advice to stabilize black-box policies for nonlinear control.

problem Stabilizing machine-learned policies for nonlinear control with limited model information.
method Proposes an adaptive λλ-confident policy to combine black-box and model-based advice.
result Proves the stability of the adaptive λλ-confident policy and its competitive ratio.

Machine learning (ML) classifiers are vulnerable to adversarial examples. An adversarial example is an input sample which is slightly modified to induce misclassification in an ML classifier. In this work, we investigate white-box and grey-box evasion attacks to an ML-based malware detector and conduct performance eval…

2019-04-07abs ↗pdf ↗

Paper proposes an efficient method for bounding box annotation in object detection.

problem Manual annotation of bounding boxes is tedious and resource-intensive.
method Iterative training of object detector on small batches of labeled images, with human annotator correcting errors.
result Significant reduction in human annotation effort, up to 75%.

P-BO reduces black-box adversarial attacks by 10x with Bayesian optimization and function prior.

problem Efficiently generating adversarial examples against black-box models.
method Prior-guided Bayesian Optimization (P-BO) with a function prior initialized from a surrogate model.
result Significantly reduces the number of queries needed for adversarial attacks.

New action poisoning attacks improve LinUCB's performance by changing action signals.

problem Improving understanding of adversarial attacks on contextual bandit algorithms.
method Proposed action poisoning attacks in white-box and black-box settings.
result Action poisoning attacks can force LinUCB to pull a target arm frequently with low cost.

Paper proposes a black-box technique to generate adversarial samples.

problem Robustness of Deep Neural Networks (DNNs) to adversarial samples.
method Black-box Momentum Iterative Fast Gradient Sign Method (BMI-FGSM) using Differential Evolution to approximate gradients.
result Achieves high success rates in generating adversarial samples and misclassification.

DNAMite creates interpretable, calibrated survival analysis models.

problem Limited interpretability in survival analysis models, especially for healthcare applications.
method Feature discretization and kernel smoothing in embedding module for flexible shape functions.
result DNAMite produces calibrated shape functions interpretable as contributions to cumulative incidence function.

Breiman discusses two statistical cultures, advocating for more research on 'before' and 'after' the black box.

problem Statistical modeling lacks exploration of processes before and after the 'black box'.
method Analyzes Breiman's visual metaphor of two statistical cultures.
result Promotes the importance of studying the 'before' and 'after' of data transformations.

New approach improves black-box planning efficiency by discovering focused macros.

problem Difficulty of deterministic planning increases exponentially with depth.
method Discovering macro-actions with focused effects to improve goal-count heuristics.
result Focused macros dramatically improve black-box planning efficiency.

Firm size data usually do not show the normality that is often assumed in statistical analysis such as regression analysis. In this study we focus on two firm size data: the number of employees and sale. Those data deviate considerably from a normal distribution. To improve the normality of those data we transform them…

2015-11-23abs ↗pdf ↗

Develops method to assess feature importance in black-box models for unconditional distribution.

problem Lack of methods to analyze feature importance in black-box models for unconditional distribution.
method Approximation method to compute feature importance curves for unconditional distribution.
result Produces sparse and faithful results, computationally efficient.

We present an interpretable companion model for any pre-trained black-box classifiers. The idea is that for any input, a user can decide to either receive a prediction from the black-box model, with high accuracy but no explanations, or employ a companion rule to obtain an interpretable prediction with slightly lower a…

2020-02-10abs ↗pdf ↗