Counterfactual learning is a natural scenario to improve web-based machine translation services by offline learning from feedback logged during user interactions. In order to avoid the risk of showing inferior translations to users, in such scenarios mostly exploration-free deterministic logging policies are in place. …
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Deterministic scenarios”
IB fails in deterministic scenarios, revealing three key issues.
problem Information bottleneck method's limitations in deterministic scenarios.
method Demonstrated three caveats and proposed a new functional.
result IB curve cannot be recovered by IB Lagrangian for deterministic .
New theory extends LQ control to non-exponential discount scenarios.
problem Time-inconsistent deterministic LQ control problems.
method Extended equivalent relationship to non-exponential discount functions, studied Riccati equation solvability.
result Existence and uniqueness of linear equilibrium for time-inconsistent LQ problem.
Paper proposes efficient algorithm for recovering sparsity pattern from deterministic missing data.
problem Recovering sparsity pattern from datasets with deterministic missing structure.
method Proposes an efficient algorithm for missing value imputation using topological property of censorship filter.
result Consistently recovers the sparsity pattern with high probability in polynomial time and logarithmic sample complexity.
RegFlow models future states with flexible probability distributions.
problem Predicting future states under complex, non-deterministic scenarios.
method Hypernetwork architecture and continuous normalizing flow model.
result RegFlow achieves state-of-the-art results on benchmark datasets.
Investigates optimal execution under time-varying liquidity, preventing price manipulation.
problem Optimal execution with time-varying liquidity impacts and price manipulation prevention.
method Almgren-Chriss framework, deterministic time variation, well-posedness, second-order conditions, price manipulation prevention.
result Sufficient conditions for a unique solution and prevention of price manipulation.
New method selects critical DER scenarios for distribution grid investment planning.
problem Determining critical DER adoption scenarios for risk assessment in distribution grids.
method Bayesian Optimization framework using Gaussian Process surrogates and Pareto-critical acquisition function.
result Statistical guarantee and significant speed-up over exhaustive search in selecting critical DER scenarios.
We extend probabilistic programming to handle conditioning on marginal distributions.
problem Conditioning probabilistic programs on marginal distributions of observable variables.
method We define and implement stochastic conditioning, allowing inference in probabilistic programs conditioned on marginal distributions.
result We demonstrate the effectiveness of stochastic conditioning in various real-life scenarios.
DRL-DPT improves energy efficiency in wireless networks with deterministic power control.
problem Severe performance degradation in traditional ICIC schemes with complex interference patterns.
method Deep Reinforcement Learning with Deterministic Policy and Target (DRL-DPT) framework.
result Consistently outperforms existing schemes in terms of energy efficiency and throughput.
LLM generates coherent macroeconomic stress scenarios for portfolio risk assessment.
problem Macro-financial stress testing and portfolio risk assessment using traditional methods.
method Hybrid prompt-RAG pipeline combining structured prompting and retrieval of country fundamentals and news.
result LLM-generated scenarios yield stable tail-risk amplification with limited sensitivity to retrieval choices.
Electrostatics method samples complex distributions deterministically.
problem Sampling and inference of complex, high-dimensional distributions.
method Electrostatics-based particle system with Newton mechanics principles.
result Method achieves comparable performance to other methods in benchmark tasks.
Study the tradeoffs of bandit feedback in multiclass classification.
problem The price of using bandit feedback in multiclass classification.
method Mistake bound model, analysis of variants, and comparison of learners and adversaries.
result The optimal mistake bound under bandit feedback is at most times higher than in full information, with a tight bound of .
Paper improves SVaR estimation for stress testing under macro scenarios using a hybrid GPR-HS framework.
problem Numerical instability in traditional SVaR estimation under extreme shocks.
method Extends GPR-HS framework to forward-looking stress scenarios with SACS for stable covariance.
result Stable SVaR ranges from -2.1020% to -2.2231%, preserving coherence property.
New method uses tensor decompositions to overcome the curse of dimensionality for large-scale learning.
problem Large-scale machine learning problems with kernel methods.
method Deterministic Fourier features combined with low-rank tensor decomposition for tensor product structure.
result Demonstrated consistent performance and superior results compared to random Fourier features.
We consider the problem of online linear regression on arbitrary deterministic sequences when the ambient dimension d can be much larger than the number of time rounds T. We introduce the notion of sparsity regret bound, which is a deterministic online counterpart of recent risk bounds derived in the stochastic setting…
Statistical Robust Chinese Remainder Theorem for Multiple Numbers: Wrapped Gaussian Mixture Modelstat.ML
Paper introduces statistical CRT for robust multiple parameter estimation.
problem Ambiguity resolution problem with exponential failure probability.
method Proposes a wrapped Gaussian mixture model and two novel approaches for robust estimation.
result Statistically based scheme achieves stronger robustness, especially in low SNR.
LLMs produce volatile sentence-level sentiment classifications that affect financial decision-making.
problem Volatile outputs from LLMs impact financial text understanding tasks.
method Case study on US equity market investing via news sentiment analysis.
result Volatile LLM outputs lead to significant variations in portfolio construction and returns.
Proposes a multi-fidelity machine learning strategy integrating low-fidelity deterministic and high-fidelity Bayesian models.
problem Addressing the accuracy-efficiency trade-off in machine learning with scarce high-fidelity data.
method Integrates a non-probabilistic regression model for low-fidelity with a Bayesian model for high-fidelity, trained in a staggered scheme.
result Achieves comparable performance in mean and uncertainty estimation with reduced training time and effective mitigation of overfitting.
In this work we develop a tractable structural model with analytical default probabilities depending on a random default barrier and possibly random volatility ideally associated with a scenario based underlying firm debt. We show how to calibrate this model using a chosen number of reference Credit Default Swap (CDS) …
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matricescs.LG
Improved COD algorithm reduces streaming AMM errors and uses less space.
problem Efficiently approximate matrix multiplication with limited memory.
method Tighter error bound for COD, space optimality, sparse matrix variant.
result Improved COD is space optimal and more efficient for sparse matrices.
Subspace clustering is the problem of partitioning unlabeled data points into a number of clusters so that data points within one cluster lie approximately on a low-dimensional linear subspace. In many practical scenarios, the dimensionality of data points to be clustered are compressed due to constraints of measuremen…
An important application of intelligent vehicles is advance detection of dangerous events such as collisions. This problem is framed as a problem of optimal alarm choice given predictive models for vehicle location and motion. Techniques for real-time collision detection are surveyed and grouped into three classes: ran…
New bounds estimate learning algorithm performance using prediction information.
problem Estimating the performance of black-box learning algorithms.
method Information-theoretic bounds based on prediction information.
result Improved bounds applicable to deterministic algorithms and easier to estimate.
EVI-MMD approximates target distributions via MMD minimization with adaptive kernel.
problem Approximating target distributions using kernel discrepancy methods.
method EVI-MMD uses Maximum Mean Discrepancy (MMD) to minimize kernel discrepancy, solving ODEs with implicit Euler scheme and L-BFGS optimization.
result EVI-MMD with adaptive bandwidth selection significantly improves performance in sampling problems.
In this paper, we propose the uncertain volatility models with stochastic bounds. Like the regular uncertain volatility models, we know only that the true model lies in a family of progressively measurable and bounded processes, but instead of using two deterministic bounds, the uncertain volatility fluctuates between …
This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods depending on whether rank information is explicitly or implicitly utilized. Surpri…
This paper proposes and studies a detection technique for adversarial scenarios (dubbed deterministic detection). This technique provides an alternative detection methodology in case the usual stochastic methods are not applicable: this can be because the studied phenomenon does not follow a stochastic sampling scheme,…
Two-layer networks learn hard GLMs with SGD in high dimensions.
problem Learning hard generalized linear models with SGD in high-dimensional settings.
method Reduction of SGD dynamics to a stochastic process in lower dimensions, focusing on the role of stochasticity.
result Overparameterization enhances convergence by a constant factor, suggesting minimal role of stochasticity.
This paper develops an active sensing method to estimate the relative weight (or trust) agents place on their neighbors' information in a social network. The model used for the regression is based on the steady state equation in the linear DeGroot model under the influence of stubborn agents, i.e., agents whose opinion…
A system for supervising decentralized finance risks using LLMs and structured evidence.
problem Supervising decentralized finance risks
method Forecast-grounded agentic supervision system
result Developed a system that scores tickets against a regulator-aligned ground truth and false-intervention rate.
HJM Local Volatility Modelq-fin.PR
Improved LV model for interest rate swaptions and caplets.
problem Calibration of arbitrage-free LV models to European options.
method HJM interest rate model with Small Volatility Approximation.
result Deterministic and fast method with excellent calibration accuracy.
DeXposure-Claw supervises decentralized finance risks by grounding LLM decisions in evidence.
problem Weak evidence leads to over-interventions by general-purpose LLM agents in decentralized finance.
method DeXposure-Claw uses a graph time-series foundation model to forecast exposure networks, turning forecasts into alerts and constraining escalation with data-health gates.
result DeXposure-Claw reduces false alarms and improves regulator alignment in decentralized finance risk supervision.
SAM optimizer struggles to converge to global minima or stationary points in practical settings.
problem Limited convergence of SAM optimizer to global minima or stationary points in practical scenarios.
method Deterministic and stochastic versions of SAM with constant perturbation size and gradient normalization were studied.
result SAM has limited capability to converge to global minima or stationary points in many scenarios.
New method solves saddle-point problems faster than existing methods.
problem Large-scale saddle-point problems in optimization.
method Sequential subspace optimization with proximal regularization.
result Significantly better convergence compared to first-order methods.
Efficient inference for multimodal Gaussian mixture models of interacting dynamical systems.
problem Efficient inference for multimodal distributions in stochastic dynamical systems.
method Graph neural networks with moment matching for sample-free inference and structured covariance approximations.
result Sample-free inference with improved efficiency and stability compared to Monte Carlo alternatives.
This work improves identifiability conditions for sparse component analysis with low-rank data.
problem Identify unique dictionary and sparse matrix components in low-rank data.
method Deterministic analysis of sparse component analysis with low-rank structure, providing bounds on sample size for identifiability.
result New bounds on the number of samples required for identifiability, improving over previous results.
Backprop-Q extends standard backpropagation for stochastic computation graphs.
problem Applying standard backpropagation to stochastic computation graphs is challenging.
method Construct Q-functions for each stochastic node and use them to train the SCG with standard backpropagation.
result Generalized backpropagation for stochastic computation graphs is feasible and extends learning signals beyond gradients.
Unified methods for fast column selection in various applications.
problem Efficiently selecting columns for low-rank approximations in data science and machine learning.
method Deterministic and randomized algorithms exploiting nuclear scores.
result Theoretical guarantees and performance bounds for column selection.
In this paper, we present our approach to solve a physics-based reinforcement learning challenge "Learning to Run" with objective to train physiologically-based human model to navigate a complex obstacle course as quickly as possible. The environment is computationally expensive, has a high-dimensional continuous actio…
Developed mlf-core for deterministic machine learning.
problem Ensuring machine learning models are deterministic for verification.
method Formulated requirements, developed mlf-core ecosystem, tested various models.
result Demonstrated deterministic models in biomedical fields.
From Target Tracking to Targeting Track -- Part III: Stochastic Process Modeling and Online Learningeess.SY
This study models target trajectories using stochastic processes for efficient tracking.
problem Efficiently modeling and predicting target trajectories in continuous time.
method Decomposes trajectory modeling into deterministic and stochastic components using Gaussian or Student's- processes.
result Demonstrates superior performance in tracking maneuvering targets compared to existing methods.
Study on regret minimization in deterministic MDPs.
problem Minimizing regret in deterministic reinforcement learning.
method Logarithmic regret lower bounds, leveraging graph theory and cycles.
result Explicitly quantifies the fundamental limit of performance achievable by any learning algorithm.
Pricing and hedging the prepayment option of mortgages under stochastic housing market activityq-fin.PR
The study models mortgage prepayment risk using stochastic housing market activity.
problem Modeling prepayment risk in mortgages under varying housing market conditions.
method Developed a stochastic model for prepayment option value, using swaption pricing formulas and non-standard actuarial hedging.
result Housing market covariance significantly impacts prepayment option prices.
Paper improves reinforcement learning efficiency with deterministic value gradients.
problem High sample complexity in model-free DDPG algorithms for continuous control tasks.
method Proposes DVG and DVPG algorithms with infinite horizon value gradients to improve sample efficiency.
result DVPG algorithm substantially outperforms state-of-the-art methods on continuous control benchmarks.
We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While there is vast literature on heuristics for this kind of problem, such approaches are known to be susceptible to poor initializations and getting…
CGAN fails to improve deterministic sequence predictions, revealing a theoretical limitation.
problem Improving deterministic sequence predictions with CGAN.
method Developed an adversarial content loss approach.
result CGAN does not improve deterministic sequence predictions.
A framework for multi-agent learning improves coordination through a memory-driven communication protocol.
problem Coordination and synchronisation in multi-agent systems with limited observations.
method A memory-driven communication protocol learned concurrently with individual policies during training.
result Superior performance in small-scale systems with up to six agents, demonstrating improved coordination.
Paper combines deterministic and stochastic inference methods for PGMs.
problem Combining biases from deterministic methods and high costs from Monte Carlo.
method Sequential Monte Carlo algorithm that uses output from deterministic approximations.
result Improves upon deterministic methods and Monte Carlo by reducing biases and computational costs.