We address the problem of imitation learning with multi-modal demonstrations. Instead of attempting to learn all modes, we argue that in many tasks it is sufficient to imitate any one of them. We show that the state-of-the-art methods such as GAIL and behavior cloning, due to their choice of loss function, often incorr…
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 “Behavioral Divergence”
New model learns better policies from expert demonstrations with higher efficiency.
problem Learning accurate policies from expert demonstrations with high efficiency.
method Generative adversarial imitation learning (GAIL) model that learns -divergence automatically.
result Learns better policies with higher data efficiency in physics-based control tasks.
We propose a method for modeling and learning turn-taking behaviors for accessing a shared resource. We model the individual behavior for each agent in an interaction and then use a multi-agent fusion model to generate a summary over the expected actions of the group to render the model independent of the number of age…
New method trains neural samplers to sample from multi-modal distributions efficiently.
problem Mode-seeking behavior of reverse KL divergence hinders effective sampling from multi-modal target distributions.
method Minimizing reverse diffusive KL divergence along diffusion trajectories of model and target densities.
result Demonstrated enhanced sampling performance across various multi-modal distributions.
Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Modelscs.LG
Method prevents model divergence in rapidly changing ad markets.
problem Model divergence due to rapid ad turnover and discontinuity.
method Dual ascent optimization with latent vector constraints.
result Significant reduction in diverging instances and improved user experience/revenue.
SAD Neural Networks: Divergent Gradient Flows and Asymptotic Optimality via o-minimal Structurescs.LG
Gradient flows of neural networks converge to optimal values or diverge, with thresholds and asymptotic behaviors.
problem Understanding the convergence and divergence of gradient flows in neural networks.
method Analysis of gradient flows on loss landscapes of neural networks using o-minimal structures.
result Gradient flows either converge to optimal values or diverge to infinity, with thresholds and asymptotic behaviors.
Higher-Order Ambiguity Attitudesq-fin.RM
Model-free preference under ambiguity defined and applied.
problem Understanding and quantifying ambiguity aversion and prudence.
method Introduces a new model-free definition of ambiguity attitudes and applies it in various contexts.
result New definition of ambiguity prudence equivalent to specific mathematical functions.
We construct convergent and divergent lattices in negative curvature and give a precise asymptotic description of the behavior of their counting function.
New approach mitigates feedback divergence in imitation learning.
problem Divergence between held-out error and learner performance in imitation learning.
method Identifies covariate shift as the root cause and proposes a simulator-based solution.
result Naive behavioral cloning performs well in real-world decision making problems.
Stabilizes policy optimization with off-policy data using divergence augmentation.
problem Premature convergence and instability in policy optimization with off-policy data.
method Incorporates Bregman divergence between behavior and current policies to ensure safe policy updates.
result Empirically shows better performance in data-scarce scenarios compared to other algorithms.
New approach to QFT divergences uses curved momentum space.
problem UV divergences in quantum field theory.
method Geodesic metric in curved momentum space.
result Intrinsic suppression of high-energy divergences.
The paper estimates eigenvalues for specific differential operators on curved spaces.
problem Estimating eigenvalues for a class of elliptic differential operators on Riemannian manifolds.
method Analyzes eigenvalue estimates for a broader class of elliptic differential operators in divergence form.
result Provides eigenvalue estimates for Gaussian shrinking solitons and specific domains.
Bayesian neural networks ignore data in infinite units limit.
problem Pathological behavior of posterior in over-parameterized networks.
method Mean-field variational inference in infinite hidden units limit.
result Posterior mean converges to zero, ignoring data.
A study on -GANs proving convergence and estimation guarantees.
problem Analyzing the convergence and estimation guarantees of -GANs.
method Proved a correspondence between -GANs and -divergences, and provided estimation bounds.
result Estimation bounds indicate diverse GAN behavior as a function of .
Paper proposes f-DPG for aligning language models with preferences.
problem Aligning language models with user preferences.
method Uses f-divergence to approximate target distributions and minimizes a forward KL from it using DPG.
result Jensen-Shannon divergence often outperforms forward KL divergence, leading to significant improvements.
We characterize sequences of Kleinian surface groups with convergent subsequences in terms of the asymptotic behavior of the ending invariants of the associated hyperbolic 3-manifolds. Asymptotic behavior of end invariants in a convergent sequence predicts the parabolic locus of the algebraic limit as well as how the a…
Linear Q-learning converges to a bounded set without divergence.
problem Proving linear Q-learning does not diverge and converges to a bounded set.
method No modifications to the original linear Q-learning algorithm, no Bellman completeness or near-optimality assumptions, only an ε-softmax behavior policy with adaptive temperature.
result First convergence rate of linear Q-learning iterates to a bounded set.
t-SNE algorithm's points remain bounded under gradient flow.
problem Understanding the boundedness of t-SNE points.
method Gradient flow of t-SNE with KL divergence, examining weak convergence assumptions.
result Points generated by t-SNE remain bounded under gradient flow.
The paper analyzes the statistical properties of GANs using -divergence.
problem Understanding the statistical behavior of GANs and comparing different -divergences.
method Asymptotic analysis of -divergence GANs, including Kullback-Leibler divergence.
result Asymptotically equivalent GANs with the same discriminator classes for correctly specified models.
Paper proposes SinkhornDRL for distributional RL using Sinkhorn divergence and regularized Wasserstein loss.
problem Improving distributional reinforcement learning by minimizing Bellman return distribution differences.
method Introduces SinkhornDRL, a distributional RL algorithm using Sinkhorn divergence and regularized Wasserstein loss.
result SinkhornDRL consistently outperforms or matches existing algorithms on Atari games, especially in multi-dimensional reward settings.
Improved Bayesian inference using power priors with historical data.
problem Improving Bayesian inference with historical data.
method Generalized power priors that adapt to the parameter of Amari's -divergence.
result Improved performance through appropriate choices of the parameter.
Nearly Minimax Discrete Distribution Estimation in Kullback-Leibler Divergence with High Probabilitystat.ML
The paper optimizes distribution estimation with high probability in Kullback-Leibler divergence.
problem Estimating discrete distributions with high probability in Kullback-Leibler divergence.
method Uses online learning techniques for novel estimator construction via online-to-batch conversion.
result Optimal rate of estimation is pinned down up to a doubly logarithmic factor of K.
Paper shows robust generative learning with minimal assumptions on target distributions.
problem Learning generative models with minimal assumptions on target distributions.
method Lipschitz-regularized -divergences with minimal assumptions.
result Stable learning across various target distributions with minimal assumptions.
A new model corrects inhomogeneity in Optimal Transport with Boundary.
problem Inhomogeneity in UROT models for Optimal Transport with Boundary.
method Proposed a modified entropic regularization term to make UROT models homogeneous.
result Homogeneous UROT model preserves properties of standard UROT while correcting inhomogeneity.
Paper tackles offline RL from mixed datasets with adaptive KL regularizer.
problem Challenges in optimizing RL and BC signals with varying action coverage and multiple action modes.
method Adaptively weighted reverse KL divergence regularizer based on TD3 algorithm.
result Empirically outperforms existing offline RL algorithms in MuJoCo locomotion tasks.
This paper reveals periodic behavior in neural network training with BN and weight decay.
problem Understanding the dynamics of neural network training with BN and weight decay.
method Rigorous investigation of empirical and theoretical mechanisms.
result Periodic behavior in training is a generalization of previously opposing perspectives.
ABS dynamically adjusts batch size based on policy stability, improving RL performance.
problem Diminishing returns with large batch sizes in RL due to non-stationary data.
method Adaptive Batch Scaling (ABS) with Behavioral Divergence metric.
result Larger batch sizes can improve RL performance, contrary to conventional wisdom.
AES uses α-divergence to select informative points for BO, improving optimization performance.
problem Optimizing complex functions with limited evaluations.
method AES uses α-divergence to select points based on dependency with global maximum.
result AES outperforms other information-based acquisition functions in various experiments.
Unified framework for imitation learning via moment matching.
problem Closing the gap between imitation and real-world performance.
method Classifying imitation learning algorithms based on reward or action-value moment matching, considering adversarial divergences.
result Derivation of bounds on policy performance for all algorithms in each class, and introduction of moment recoverability.
RTVAE uses β-divergence to detect anomalies in tabular data robustly.
problem Outliers in tabular data affect VAE training and anomaly detection.
method Robust VAE with β-divergence for mixed categorical and continuous features.
result Demonstrates effectiveness on network traffic anomaly detection.
New approach categorizes objective functions for embodied agents.
problem Understanding how objectives relate to each other and discovering new objectives.
method Introducing Action Perception Divergence (APD) to categorize objective functions.
result Introduces a spectrum of objectives from narrow to general, explaining various unsupervised objectives.
Stein variational gradient descent (SVGD) is a deterministic sampling algorithm that iteratively transports a set of particles to approximate given distributions, based on an efficient gradient-based update that guarantees to optimally decrease the KL divergence within a function space. This paper develops the first th…
Paper introduces SDM for detecting LLM hallucinations, improving on entropy tests.
problem Challenges of Large Language Models (LLMs) with non-factual, nonsensical responses.
method Joint clustering on sentence embeddings to measure semantic divergence between prompts and responses.
result SDM framework detects deeper form of arbitrariness in LLM responses.
This paper analyzes privacy risks in neural network pruning and proposes a defense mechanism.
problem Privacy risks in neural network pruning due to membership inference attacks.
method Investigates the impact of pruning on prediction divergence and proposes a self-attention membership inference attack.
result Proposed defense mechanism mitigates privacy risks while maintaining sparsity and accuracy.
Study statistical guarantees for DRO with OT and OT-regularized divergences.
problem Enhancing adversarial robustness in machine learning models.
method Derive concentration inequalities for supervised learning via DRO-based adversarial training.
result First to cover soft-constraint costs and reweighting mechanisms in adversarial training.
The estimation of an f-divergence between two probability distributions based on samples is a fundamental problem in statistics and machine learning. Most works study this problem under very weak assumptions, in which case it is provably hard. We consider the case of stronger structural assumptions that are commonly sa…
Study reveals LLM personality patterns but lacks behavioral consistency.
problem Understanding and validating personality traits in LLMs.
method Characterized LLM personality across three dimensions: training dynamics, self-report validity, and intervention effects.
result Self-reported traits do not reliably predict behavior, and instructional alignment affects trait expression but not behavior.
Process Monitoring involves tracking a system's behaviors, evaluating the current state of the system, and discovering interesting events that require immediate actions. In this paper, we consider monitoring temporal system state sequences to help detect the changes of dynamic systems, check the divergence of the syste…
ANTIDOTE reduces noisy labels influence during learning.
problem Learning with noisy labels.
method Information-divergence neighborhood relaxation and adversarial training.
result ANTIDOTE outperforms standard cross-entropy loss in noisy label settings.
New method makes quality metrics scale-invariant for high-dimensional data.
problem Scale sensitivity in quality metrics affects the accuracy of data projections.
method Analytical and empirical investigation of stress and KL divergence; introduction of a scale-invariant technique.
result The proposed technique accurately captures expected behavior and makes metrics scale-invariant.
A new framework for offline RL improves policy flexibility and regularity.
problem Lack of environmental interactions in offline RL leads to poor policy performance.
method Proposes a behavior-regularized implicit policy framework with modified policy-matching methods.
result The framework improves policy effectiveness and robustness beyond static datasets.
We consider model-based reinforcement learning in finite Markov De- cision Processes (MDPs), focussing on so-called optimistic strategies. In MDPs, optimism can be implemented by carrying out extended value it- erations under a constraint of consistency with the estimated model tran- sition probabilities. The UCRL2 alg…
Deep learning models can have low bias and variance, contrary to classical theory.
problem Understanding the performance of deep learning models at high complexity.
method Developed a fine-grained bias-variance decomposition for random feature kernel regression, analyzing the effects of sampling, initialization, and labels.
result The variance terms exhibit non-monotonic behavior and can diverge at the interpolation boundary, even in the absence of label noise.
Investor attention is an important concept in behavioral finance. Many articles have conducted cross-disciplinary research leading by this concept. In this paper, we use data extraction technology to collect a large number of Baidu Index keyword search volume data. After analyzing the data, we draw a conclusion that ha…
The empirical NTK diverges from the NTK in classification problems during overtraining.
problem The divergence of empirical NTK from NTK in classification problems during overtraining.
method Demonstrated strictly positive definiteness of NTKs for FCNs and ResNets. Proved divergence of neural network parameters during training with cross-entropy loss.
result The empirical NTK does not uniformly converge to the NTK across all times on the training samples as the network width increases.
The speculation game is an agent-based toy model to investigate the dynamics of the financial market. Our model has achieved the reproduction of 10 of the well-known stylized facts for financial time series. However, there is also a divergence from the behavior of real market. The market price of the model tends to be …
Unified framework for generating heavy-tailed distributions.
problem Extending SGMs to heavy-tailed targets.
method Combining early stopping with initialization for diffusion, and normalizing flows for generation.
result Unified generative framework with theoretical guarantees for heavy-tailed distributions.
Study scaling of optimal solutions for reliability constraints in resource provisioning.
problem Achieving high reliability in resource provisioning under stringent requirements.
method Chance-constrained optimization, distributionally robust optimization, f-divergence balls, line search.
result Correct scaling properties of optimal decisions are preserved by using appropriate f-divergence balls, leading to conservative yet near-optimal solutions.