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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for partial monitoring

IDS algorithm optimizes sequential decisions in various monitoring settings.

problem Optimizing sequential decisions in complex monitoring scenarios.
method Information-directed sampling (IDS) algorithm for linear partial monitoring.
result IDS achieves nearly worst-case rate optimality in finite-action games.

New Thompson sampling algorithm for stochastic partial monitoring achieves logarithmic regret.

problem Limited feedback in sequential learning problems.
method Developed a novel Thompson-sampling-based algorithm to sample from the posterior distribution exactly.
result Achieved logarithmic regret bound of O(log T) for a linearized variant of the problem.

We provide a simple and efficient algorithm for adversarial kk-action dd-outcome non-degenerate locally observable partial monitoring game for which the nn-round minimax regret is bounded by 6(d+1)k3/2nlog(k)6(d+1) k^{3/2} \sqrt{n \log(k)}, matching the best known information-theoretic upper bound. The same algorithm also achieves…

2019-07-12abs ↗pdf ↗

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss and receives a feedback signal, both of which are fixed functions of the action a…

2011-02-10abs ↗pdf ↗

New algorithms reduce regret in both stochastic and adversarial partial monitoring problems.

problem Partial monitoring with kk-actions and dd-outcomes.
method Follow-the-regularized-leader framework, exploration by optimization, adaptive learning rate.
result Best-of-both-worlds algorithms with favorable regret bounds in stochastic and adversarial settings.

In approachability with full monitoring there are two types of conditions that are known to be equivalent for convex sets: a primal and a dual condition. The primal one is of the form: a set C is approachable if and only all containing half-spaces are approachable in the one-shot game; while the dual one is of the form…

2013-05-23abs ↗pdf ↗

Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of Blackwell's approachability theorem, in an other auxiliary game. We establish the converse: a strategy that approaches a convex BB-set can be…

2010-06-09abs ↗pdf ↗

New algorithm minimizes expert selection regret in partial bandit feedback.

problem Minimizing expert selection regret in partial bandit feedback.
method Develops a sequential minimax optimal algorithm for a generalized partial monitoring setting.
result Second order regret bounds against a general expert selection sequence.

We present a new anytime algorithm that achieves near-optimal regret for any instance of finite stochastic partial monitoring. In particular, the new algorithm achieves the minimax regret, within logarithmic factors, for both "easy" and "hard" problems. For easy problems, it additionally achieves logarithmic individual…

2012-06-27abs ↗pdf ↗

The method and characteristics of several approaches to the pricing of discretely monitored arithmetic Asian options on stocks with discrete, absolute dividends are described. The contrast between method behaviors for options with an Asian tail and those with monitoring throughout their lifespan is emphasized. Rates of…

2017-02-03abs ↗pdf ↗

Improved ExO method achieves near-optimal bounds in both stochastic and adversarial settings.

problem Finding optimal exploration strategies in online decision-making with limited feedback.
method Exploration by Optimization with hybrid regularizers for locally observable games.
result Achieved nearly optimal bounds of O(aeqak2m2logT/Δa)O(\sum_{a eq a^*} k^2 m^2 \log T / Δ_a) in stochastic and adversarial environments.

A convolutional sequence to sequence non-intrusive load monitoring model is proposed in this paper. Gated linear unit convolutional layers are used to extract information from the sequences of aggregate electricity consumption. Residual blocks are also introduced to refine the output of the neural network. The partiall…

2018-06-06abs ↗pdf ↗

The paper proposes a method to monitor deep learning predictions for retraining, reducing costs.

problem Reducing computational costs in deep learning by detecting when predictions are no longer valid.
method Sequential monitoring of network predictions based on projected second moments monitoring.
result The proposed method can drastically reduce computational costs in deep learning.

Neural networks compress and sample WDN contamination dynamics efficiently.

problem Infrastructure monitoring of complex, networked systems like water distribution networks is expensive and challenging.
method Developed Graph Fourier Transform (GFT) operators and neural networks (NN) for efficient data collection and inference.
result High accuracy reconstruction of contamination dynamics using only 5-10% of the sample set.

Study on multi-agent decision making complexity, showing sample efficiency gaps.

problem Understanding sample efficiency in multi-agent decision making.
method General framework for interactive decision making, focusing on equilibrium computation.
result No 'reasonable' complexity measure can close gaps between single and multiple agents.

This paper presents a new asymptotic expansion method for pricing continuously monitoring barrier options. In particular, we develops a semi-group expansion scheme for the Cauchy-Dirichlet problem in the second-order parabolic partial differential equations (PDEs) arising in barrier option pricing. As an application, w…

2012-02-14abs ↗pdf ↗

Expert-guided model improves seismic compliance monitoring.

problem Classifying seismic data with missingness and expert knowledge.
method Expert-guided class-conditional model with interpretable goodness-of-fit features.
result Interpretable classifier outperforms standard machine learning, especially with small training data.

We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Least Squares stands out of well-known classical approaches as e.g. Ridge Regression or Principal Components Regression, as it is not defined as…

2009-02-25abs ↗pdf ↗

AI systems that explain their decisions can be monitored for harmful intentions.

problem Monitoring AI systems' decision-making processes for harmful intentions is imperfect and can miss some misbehavior.
method Monitoring the chain of thought (CoT) of AI systems that communicate in human language.
result CoT monitoring is a promising but fragile approach to AI safety.

We study how to adapt to smoothly-varying ('easy') environments in well-known online learning problems where acquiring information is expensive. For the problem of label efficient prediction, which is a budgeted version of prediction with expert advice, we present an online algorithm whose regret depends optimally on t…

2019-10-19abs ↗pdf ↗

Neural Jump ODEs improve online filtering and classification with robust performance.

problem Online filtering and classification in settings with irregular and partial observations.
method Modeling conditional expectation using Neural Jump ODEs, with theoretical convergence guarantees.
result Demonstrated superior performance over classical methods, especially in complex scenarios.

Deep CNNs struggle with rare taxa; one-class classifiers help identify them.

problem Efficiently identifying rare benthic macroinvertebrates in insect monitoring.
method Combining deep CNNs with one-class classifiers to identify rare taxa.
result The proposed approach can improve rare species identification, supporting automation.

This research tackles monitoring machine learning algorithms post-deployment, addressing performativity issues.

problem Monitoring machine learning algorithms after deployment, especially when they affect their own data-generating process.
method Uses causal inference techniques to navigate performativity and compares different monitoring criteria and data sources.
result Different monitoring systems have varying operating characteristics and implications for ML monitoring design.

PITMonitor monitors model calibration over time with formal error guarantees.

problem Fixed-sample tests applied to models over time can lead to false alarms.
method PITMonitor uses mixture e-processes to detect distributional shifts in probability integral transforms.
result PITMonitor achieves competitive detection rates on river's FriedmanDrift benchmark.

A new method monitors unstructured 3D shapes without registration.

problem Error-prone registration and mesh reconstruction steps in PCD monitoring.
method Intrinsic geometric properties of shapes, using Laplacian and geodesic distances.
result Effective monitoring of defects without registration and mesh reconstruction.

Focuses on monitoring and explaining models in real-world applications.

problem Ensuring high quality machine learning services in production environments.
method Statistical techniques for model performance and data monitoring, explanations of predictions.
result Challenges and solutions for implementing monitoring and explanation in production models.

The paper proposes a method to create efficient remote monitoring models.

problem Large and complex machine learning models are unsuitable for remote monitoring on edge devices.
method Decompose the model into a simple local monitoring function and a complex correction term evaluated on the server.
result The proposed framework learns monitoring models with significantly reduced complexity that maintain safety.

New monitoring method detects ML risk models' performance changes in medical interventions.

problem Monitoring ML risk models in healthcare is complicated by confounding medical interventions.
method Developed a new score-based CUSUM monitoring procedure with dynamic control limits.
result Valid inference is possible if conditional exchangeability or time-constant selection bias hold.

DiffATD efficiently discovers targets in partially observable environments using diffusion dynamics.

problem Efficiently discovering targets in partially observable environments with limited sampling.
method DiffATD uses diffusion dynamics to maintain a belief distribution over unobserved states, balancing exploration and exploitation.
result DiffATD outperforms baselines and supervised methods in diverse domains.

Theoretical analysis of MCR for improving imputation quality in partially observed data.

problem Improving model generalization in partially observed settings.
method Theoretical analysis of Measure Consistency Regularization (MCR) for neural network distance.
result MCR's generalization advantage is not always guaranteed and can be monitored through a duality gap.