Differential privacy reduces bias in adaptive data gathering.
problem Bias in adaptive data gathering, including numeric and complex data.
method Apply differential privacy to reduce bias and correct p-values.
result Near optimal regret bounds for differentially private bandit algorithms.
BED-LLM uses Bayesian experimental design to improve LLMs' information gathering.
problem Improving LLMs' ability to gather information adaptively.
method Iteratively choosing questions to maximize expected information gain using a probabilistic model.
result BED-LLM achieves substantial performance gains compared to other adaptive design strategies.
Paper simplifies complex AI exploration by predicting future rewards.
problem Training machines to optimally gather complex information.
method Developed a denser reward structure using cross-value to decouple exploration and exploitation.
result Demonstrated successful learning of challenging tasks without shaping or bonuses.
Foundation models struggle with multi-turn exploration but can learn through regular summaries.
problem Foundation models struggle with multi-turn exploration in dynamic environments.
method Implemented a text-based version of the Alchemy environment to test multi-trial learning. Prompting models to summarize their observations at regular intervals enabled them to improve across trials and adapt to changes.
result Foundation models can improve through regular summaries, enabling multi-trial learning and adaptation.
Study uses contextual bandits to optimize charity exposure in donation solicitation.
problem Optimizing charity exposure in donation solicitation using survey responses.
method Adaptive experiment design to balance cumulative regret minimization and simple regret minimization.
result Adaptive experimentation yields better policy learning outcomes than uniform randomization.
Step-DAD improves BED by periodically updating a design policy during experiments.
problem Improving flexibility and robustness in Bayesian experimental design.
method Semi-amortized, policy-based approach that updates a design policy during data collection.
result Consistently superior decision-making and robustness compared to current BED methods.
Paper proposes a debiased estimator for adaptive linear regression.
problem Non-normal asymptotic behavior of OLS estimator in adaptive linear regression.
method Adaptive linear estimating equations to construct debiased estimator.
result Established asymptotic normality of the debiased estimator.
FairBED: A Bayesian Experimental Design Approach to Gathering Fairer Data
problem Ensuring fairness in machine learning
method Bayesian Experimental Design
result Improved fairness-accuracy trade-offs
Investment tool predicts higher returns for Madrid real estate units.
problem Determining which real estate units have higher returns to investment in Madrid.
method Data collection from Idealista.com, descriptive statistics, return index, machine learning algorithms.
result Introduction of machine learning algorithms for rental real estate price prediction.
Paper tackles privacy-preserving data density issues using deconvolution.
problem Privacy-preserving noise affects data density, leading to under/over-estimation.
method Develops deconvoluting kernel density estimators and regression models.
result Demonstrates improved accuracy in estimating heavy-hitters with locally differential data.
Algorithm improves query recommendations with immediate user feedback.
problem Lack of adaptability to immediate user feedback in query recommendation algorithms.
method Augmented transformer-based causal language models with multi-armed bandit framework.
result Substantial improvement in per-round regret compared to state-of-the-art models.
Part-of-speech (POS) tagging is a fundamental component for performing natural language tasks such as parsing, information extraction, and question answering. When POS taggers are trained in one domain and applied in significantly different domains, their performance can degrade dramatically. We present a methodology f…
New method learns collective behavior without communication.
problem Learning optimal individual rules for gathering without communication.
method Collective multi-agent reinforcement learning.
result Gathering behavior can be learned without communication.
MTS-CycleGAN adapts multivariate time series data for ironmaking industry.
problem Creating a domain invariant dataset from multivariate time series data of different blast furnaces.
method Adversarial-based deep mapping learning network (CycleGAN) with LSTM-based AutoEncoder and discriminator.
result MTS-CycleGAN successfully translates multivariate time series data between different blast furnaces.
Formula adjusts steady-state models for control confounding.
problem Learning steady-state models from operational data can be flawed due to control confounding.
method Derives a formula to adjust for control confounding using structural dynamical causal models.
result Estimates a causal steady-state model from closed-loop operational data.
A new sequential test for unnormalized densities.
problem Testing unnormalized densities with adaptive stopping.
method Sequential kernelized Stein discrepancy test, using non-uniform Stein kernels.
result Valid test with asymptotic lower bound for growth.
New algorithm BE reduces regret in bandit learning with positive externalities.
problem Self-reinforcing user preferences in platforms lead to suboptimal performance in bandit learning.
method Developed Balanced Exploration (BE) algorithm and an adaptive variant.
result BE and adaptive BE achieve optimal asymptotic regret in bandit learning with positive externalities.
We explore training an automatic modality tagger. Modality is the attitude that a speaker might have toward an event or state. One of the main hurdles for training a linguistic tagger is gathering training data. This is particularly problematic for training a tagger for modality because modality triggers are sparse for…
MUTLA dataset analyzes multimodal data for teaching and learning analytics.
problem Lack of a comprehensive multimodal dataset for teaching and learning analytics.
method Presented a large-scale MUTLA dataset with synchronized multimodal data from SAIL.
result Provides insights for predicting student engagement and improving adaptive learning.
This study optimizes covariate density and propensity score for efficient ATE estimation.
problem Efficiently estimating average treatment effects (ATEs) with minimal variance.
method Adaptive experiment optimizing both covariate density and propensity score.
result Proposed method minimizes the semiparametric efficiency bound for ATE estimation.
This paper studies graphical model selection, i.e., the problem of estimating a graph of statistical relationships among a collection of random variables. Conventional graphical model selection algorithms are passive, i.e., they require all the measurements to have been collected before processing begins. We propose an…
Hybrid-FL improves ML model accuracy in non-IID data environments.
problem Performance degradation in FL due to non-IID data.
method Hybrid-FL combines client and server learning, selecting optimal clients and data for aggregation.
result 13.5% higher classification accuracy than previous methods.
Optimal adaptive experiment for choosing best treatment with binary outcomes.
problem Choosing the best treatment from binary options in an adaptive experiment.
method Adaptive experiment with two phases: treatment allocation and choice. Neyman allocation method used.
result Neyman allocation is minimax and Bayes optimal, matching lower bounds for regret.
This work improves testing of machine learning model modifications using novel statistical methods.
problem Overfitting and conservative Bonferroni correction when testing multiple model modifications.
method Introduces alpha-recycling and SRGPs to control error rate and approve more beneficial modifications.
result Novel statistical methods approve a higher number of beneficial modifications than previous approaches.
We give a new proof of the representation of implied volatility as a time-average of weighted expectations of local or stochastic volatility. With this proof we clarify the question of existence of 'forward implied variance' in the original derivation of Gatheral, who introduced this representation in his book 'The Vol…
Adaptive Bayesian sampling technique simplifies mass matrix learning.
problem Complexity in learning mass matrices for adaptive samplers.
method Monte Carlo EM framework with online learning of mass matrices.
result Comparable sampling accuracy to Riemannian samplers but faster.
In this article we propose a generalisation of the recent work of Gatheral and Jacquier on explicit arbitrage-free parameterisations of implied volatility surfaces. We also discuss extensively the notion of arbitrage freeness and Roger Lee's moment formula using the recent analysis by Roper. We further exhibit an arbit…
Hybrid LSMC-PDE method for Bermudan options under GDMR model.
problem Pricing Bermudan options under the GDMR model.
method Adapted Hybrid LSMC-PDE framework, combining Monte Carlo and PDE methods.
result Hybrid approach yields more accurate and lower error estimates than plain LSMC.
Study compares static vs adaptive strategies in two trading models.
problem Optimal execution in static vs adaptive strategies.
method Discrete and continuous time models with permanent and temporary impact.
result Static strategies are nearly as optimal as adaptive ones in the studied models.
Improves flu prediction by blending environment and population info.
problem Challenges in using data from one environment in another due to feature variability and population subgroup differences.
method Population-aware hierarchical Bayesian domain adaptation framework with multiple invariant components.
result Model improves flu prediction in new environments with unlabelled data.
In this short note, we prove by an appropriate change of variables that the SVI implied volatility parameterization presented in Gatheral's book and the large-time asymptotic of the Heston implied volatility agree algebraically, thus confirming a conjecture from Gatheral as well as providing a simpler expression for th…
Neural process model improves real-time condition monitoring signal prediction.
problem Real-time adaptation for complex condition monitoring signals.
method Label-aware neural processes encoding and reconstruction.
result Advantages in real-time adaptation, enhanced signal prediction with uncertainty quantification, and joint prediction for labels and signals.
This study proposes a new model for predicting financial distress in SMEs using machine learning.
problem Challenges in predicting financial distress for SMEs due to ambiguity and limited data.
method Feature selection algorithm based on element credits and data source collection. Incorporates financial statements, governance qualities, and market data with a Relevant Vector Machine.
result The proposed model improves financial distress prediction efficiency with fewer characteristic factors.
Neural nets analyze Magic: the Gathering cards for text and images.
problem Classify Magic: the Gathering cards into multiple categories.
method Used Convolutional and Recurrent Neural Networks to analyze card text and images.
result Developed a method to generate card text matching an input image.
Bayesian optimization sped up to linear time.
problem Expensive function evaluations and cubic computational complexity.
method Flexible binary partitioning of the search space.
result Linear computational complexity and superior optimization performance.
Study benchmarks label noise detection methods, identifying best practices.
problem Label noise in real-world datasets affects model performance and evaluation reliability.
method Decomposed detection methods into label agreement, aggregation, and information gathering components; introduced a unified benchmark task and novel metric.
result In-sample probability aggregation with logit margin label agreement function achieves best results across scenarios.
A new technique called the Simulator analyzes adaptive sampling, improving on existing methods.
problem Analyzing the difficulty of distinguishing good from bad sampling strategies with limited data.
method A novel approach considering the difficulty of distinguishing strategies, matching strengths of Fano and change-of-measure techniques.
result First instance-based lower bounds for top-k problem, revealing new phenomena.
New method learns adaptive exploration strategies for dynamic tasks.
problem Learning effective exploration strategies in changing environments.
method Informed policy regularization to reduce sample complexity of RNN-based policies.
result Method learns efficient exploration strategies balancing information gathering and reward maximization.
Distributed, online data mining systems have emerged as a result of applications requiring analysis of large amounts of correlated and high-dimensional data produced by multiple distributed data sources. We propose a distributed online data classification framework where data is gathered by distributed data sources and…
Bayesian BIC for multi-trial data improves VAR model order selection.
problem Optimal VAR model order selection for multi-trial event-based data.
method Derive and apply Bayesian Information Criterion (BIC) for multi-trial ensemble data.
result Multi-trial BIC successfully recovers real model order and estimates small model order.
Paper tackles SMPC for linear systems with unknown noise distribution.
problem Stochastic MPC for linear systems with chance state constraints and unknown noise distribution.
method Reformulate chance constraints, design robust benchmark SMPC, and develop adaptive SMPC with online noise statistics learning.
result Adaptive SMPC guarantees time-uniform satisfaction of unknown reformulated state constraints with high probability.
Decentralized LDA for privacy preserving topic modeling.
problem Learning topics from decentralized networks without sharing sensitive information.
method Adapted LDA model for decentralized optimization.
result Similar topic parameters and performance at each node as with stochastic methods.
Study confirms rough volatility in financial data, independent of microstructure noise.
problem Characterizing volatility in financial markets, especially rough volatility.
method Used range-based volatility estimators to confirm findings from fractional behavior.
result Log-volatility behaves like fractional Brownian motion with an even lower Hurst exponent.
Framework detects cyber threats from Twitter tweets.
problem Time-consuming manual extraction of cyber threat intelligence.
method Novelty detection model trained on CVE data.
result F1-score of 0.643 for classifying cyber threat tweets.
Robust optimization and statistical robustness improve robot navigation policies.
problem Efficiently finding optimal robot navigation policies in uncertain environments.
method Combining robust optimization and statistical robustness with improved Bayesian optimization techniques.
result Safe and repeatable robot navigation policies are achieved with improved robust optimization methods.
Paper explores multimodal methods for detecting urban micro-events.
problem Detecting urban micro-events in cities with limited geographical coverage.
method Exploring multimodal fusion methods including early, late, hybrid fusion and representation learning.
result Multimodal approach yields higher performance than unimodal alternatives.
Proposes a max-utility arm selection strategy for reducing cumulative regret in sequential query recommendations.
problem Reduces cumulative regret in sequential query recommendations for closed loop interactive learning settings.
method Proposes a max-utility arm selection strategy based on the maximum utility of arms.
result Improves cumulative regret substantially compared to baseline algorithms and random selection.
Robots gather information resiliently despite failures and attacks.
problem Resilient information gathering in adversarial or failure-prone environments.
method First scalable algorithm for minimal communication, system-wide resiliency, and provable approximation performance.
result Algorithm ensures optimal or near-optimal solutions for any number of failures and attacks.