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

65131196261 · May 202619922001200920172026
48 results for balanced regime

Unified formula for training dynamics of linear networks combining lazy and balanced regimes.

problem Training dynamics of linear networks in two distinct setups: lazy and balanced/active.
method Unified formula for the evolution of the learned matrix, combining lazy and balanced regimes.
result Unified formula allows for rapid convergence and low rank bias, proving a complete phase diagram.

New bounds for high-dimensional sparse linear bandits, balancing information and regret.

problem Stochastic linear bandits with high-dimensional sparse features.
method Derivation of minimax regret lower and upper bounds for explore-then-commit algorithm.
result Optimal rate of Θ(n2/3)Θ(n^{2/3}) for data-poor regime, complemented by O(n)O(\sqrt{n}) under signal magnitude assumption.

Proposes a framework to balance supervised and unsupervised learning using random matrix theory.

problem Balancing supervised and unsupervised learning in high-dimensional data.
method QLDS model with quadratic margin maximization under low density separation assumption.
result Establishes a smooth bridge between supervised and unsupervised learning methods.

TV-SurvCaus improves causal inference for dynamic treatments in survival analysis.

problem Estimating causal effects of time-varying treatments on survival outcomes.
method Representation balancing techniques extended to time-varying treatment regimes with survival outcomes.
result TV-SurvCaus outperforms existing methods in estimating individualized treatment effects with time-varying covariates and treatments.

SGD in DLNs reveals feature learning dynamics.

problem Understanding SGD dynamics in DLNs during saddle-to-saddle training.
method Stochastic Langevin dynamics with anisotropic, state-dependent noise; one-dimensional per-mode SDEs; Boltzmann distribution approximation.
result SGD noise encodes feature learning progression but does not alter saddle-to-saddle dynamics.

New theory predicts deep neural networks can operate in an extended critical regime without fine-tuning.

problem Understanding the dynamics and computational principles of deep neural networks.
method Combining theories of heavy-tailed random matrices and non-equilibrium statistical physics.
result Deep neural networks can operate in an extended critical regime without fine-tuning parameters.

Neural Markov models improve time series analysis by balancing deep learning and classical models.

problem Modeling non-stationary time series with high data sparsity.
method Hybrid approach using neural networks to parameterize stochastic matrices, estimating time-inhomogeneous Markov chains.
result Reduction of Chapman-Kolmogorov discrepancy and superior likelihood in financial markets.

Sharp global guarantees for noisy overparameterized low-rank recovery.

problem Understanding practical success of overparameterization in noisy conditions.
method Unified proof technique combining escape directions and counterexample inexistence.
result Near-second-order points achieve minimax-optimal recovery bounds.

CBDA improves active learning for semantic segmentation, especially with imbalanced classes.

problem Class imbalance degrades performance in domain adaptive active learning.
method Class Balanced Dynamic Acquisition (CBDA) selects more balanced labels for active learning.
result CBDA increases minority class performance and outperforms baselines by 0.6-2.4 mIoU.

This work forecasts electricity prices using Bayesian regime detection and conditional neural processes.

problem Forecasting electricity prices with optimal operational outcomes.
method Bayesian regime detection with conditional neural processes, integrating multi-criteria decision support.
result R-NP model outperformed other models in comprehensive operational utility assessments.

Optimal data-driven formulations are found for learning and decision-making with historical data.

problem Designing optimal learning and decision-making formulations from historical data.
method Define a yardstick for measuring formulation quality, then construct an optimal formulation that is uniformly closer to the true cost.
result Existence of three distinct out-of-sample performance regimes with corresponding optimal formulations.

Exact solutions reveal how unbalanced initializations promote rapid feature learning in neural networks.

problem Understanding how neural networks efficiently extract features from data.
method Deriving exact solutions to a minimal model of neural networks transitioning between lazy and rich learning regimes.
result Unbalanced layer-specific initialization variances and learning rates determine the degree of feature learning.

Neural networks improve VaR estimation accuracy and robustness.

problem Estimating Value at Risk (VaR) in financial markets.
method Generative regime switching framework with Monte-Carlo simulations, neural networks initialized via best model, balanced incentive function, reduced training data.
result Neural networks outperform traditional methods in VaR estimation, especially with less data.

This research improves binary classification by balancing overfitting and generalization with a novel Bayesian approach.

problem Improving binary classification models to avoid overfitting and generalize well.
method Introduces a PAC-Bayes type learning rule with a balancing parameter λ to balance training error and KL divergence to a prior.
result A choice of λ ensures uniformly vanishing excess loss, even in the agnostic case, by under-regularizing or over-regularizing appropriately.

This paper examines cryptocurrency integration with traditional markets, showing how network structure and turbulence influence cross-asset spillovers.

problem Understanding how cryptocurrencies integrate with traditional financial markets and the impact of market stress on cross-asset spillovers.
method Combining rolling correlation networks, community structure, market-specific and system-wide Turbulence Indices, and VAR-based connectedness analysis.
result Cross-asset integration is episodic, with network structure and turbulence playing a role in transmission during stress periods.

We consider a model of contagion in financial networks recently introduced in the literature, and we characterize the effect of a few features empirically observed in real networks on the stability of the system. Notably, we consider the effect of heterogeneous degree distributions, heterogeneous balance sheet size and…

2011-09-06abs ↗pdf ↗

BNRE improves simulation-based inference by producing more conservative posteriors.

problem Overconfident posteriors from current simulation-based inference algorithms risk false inferences.
method Balanced Neural Ratio Estimation (BNRE) that produces more conservative posterior approximations.
result BNRE produces more conservative posterior surrogates on all tested benchmarks and simulation budgets.

Proposes a method to estimate personalized treatments from high-dimensional data.

problem Estimating individualized treatment regimes (ITRs) from high-dimensional covariates.
method Directly targets the contrast between potential outcomes, using dimension-reduced outcome-weighted learning.
result Achieves universal consistency, converging to the Bayes risk under mild conditions.

Regularized spectral methods improve clustering in signed graphs, especially for sparse data.

problem Clustering signed graphs with positive and negative edges.
method Developed regularized versions of SPONGE and Signed Laplacian methods for clustering signed graphs, especially for sparse data.
result Theoretical guarantees and empirical performance improvements for clustering signed graphs, especially in sparse regimes.

A federated model learns shared archetypes from heterogeneous clients in continual learning.

problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.

Researchers create exact minimal surfaces with helical motifs in biological structures.

problem Analyzing helical motifs in minimal surfaces of biological structures.
method Developed a method to construct exact minimal surfaces with arbitrary helical motifs.
result Exact minimal surfaces with helical motifs can be created and analyzed.

We introduce a novel framework for adversarial training where the target distribution is annealed between the uniform distribution and the data distribution. We posited a conjecture that learning under continuous annealing in the nonparametric regime is stable irrespective of the divergence measures in the objective fu…

2017-05-21abs ↗pdf ↗

Study financial contagion and risk in sparse networks with directed edges.

problem Analyzing systemic risk in sparse financial networks with balance-sheet interactions.
method Linear fraction of institutions with zero out-degree, sender-truncated subgraph G_sh, adversarial and random systemic events, explicit fan-in accumulation bound.
result Maximal forward reachability in G_sh is O(log n) with high probability in the subcritical regime, and multi-hit defaults are negligible in the supercritical regime.

Synthetic augmentation helps but not always in imbalanced learning.

problem Imbalanced learning causes poor performance on rare classes.
method Developed a statistical framework for synthetic augmentation in imbalanced learning.
result Synthetic augmentation is not always beneficial and depends on the imbalance regime.

Theoretical and empirical taxonomy of imbalance in binary classification.

problem Class imbalance degrades binary classification performance.
method Proposed a principled framework based on three scales: imbalance coefficient, sample-dimension ratio, and intrinsic separability. Derived closed-form Bayes errors and analyzed degradation across models.
result The triplet (η, κ, Δ) provides a model-agnostic explanation of imbalance-induced deterioration.

This study compares MLPs and KANs in low-data regimes, finding MLPs with personalized activation functions outperform KANs.

problem Comparing MLPs and KANs in low-data regimes.
method Introduced an effective technique for designing MLPs with unique, parameterized activation functions for each neuron.
result MLPs with personalized activation functions achieve significantly higher predictive accuracy with only a modest increase in parameters, especially in low-data regimes.

Improved off-policy selection and learning in contextual bandits with better guarantees.

problem Selecting or training a reward-maximizing policy using data from a fixed behavior policy.
method A betting-based confidence bound applied to an inverse propensity weight sequence for off-policy selection, and a freezing condition for off-policy learning.
result The proposed methods achieve significantly improved guarantees over prior work, especially in small-data regimes.

Study how firm liquidation regimes affect shareholder value and stability.

problem Balancing shareholder value and financial stability during firm liquidation.
method Modelled forced liquidation in reduced form, solved singular stochastic control problem.
result Combining distress regions below and above ruin threshold improves both shareholder value and firm survival.

Foundation models outperform supervised methods in time series forecasting across various operational regimes.

problem Lack of domain-specific training and ongoing maintenance in supervised learning for time series forecasting.
method Evaluation of foundation models against standard supervised approaches across four operational regimes: periodic, physically constrained, stochastic, and demand forecasting.
result Foundation models are optimal for cold-start or long-tail scenarios and perform well in domains with transferable periodic structures.

The paper explores fair machine learning policies for balancing competing objectives in noisy data.

problem Balancing competing objectives in noisy data.
method Analyzes a class of policies that trace an empirical Pareto frontier based on learned scores.
result Characterizes optimal strategies and bounds Pareto errors due to score inaccuracies.

This article explores and analyzes the unsupervised clustering of large partially observed graphs. We propose a scalable and provable randomized framework for clustering graphs generated from the stochastic block model. The clustering is first applied to a sub-matrix of the graph's adjacency matrix associated with a re…

2018-05-25abs ↗pdf ↗

Efficient algorithm for graph matching in correlated stochastic block models.

problem Graph matching in correlated stochastic block models with balanced communities.
method Extends previous work on centered subgraph counts to handle estimation errors and edge correlation.
result First efficient algorithm for graph matching in the logarithmic average degree regime, matching all but a vanishing fraction of vertices with high probability.

Upper bounds for second Robin eigenvalue on Riemannian surfaces.

problem Bounding the second Robin eigenvalue of Schrödinger operators on Riemannian surfaces.
method Geometric upper bound via Hersch balancing argument on capped surfaces.
result Sharp geometric restrictions for minimal surfaces in negatively curved manifolds.

Neural networks parameterize time-varying Markov dynamics in financial time series.

problem Estimating Markov transition matrices in high-resolution, high-noise financial data.
method Introduces a neural network framework to generate explicit, time-varying Markov transition matrices, constraining neural outputs to formal stochastic operators.
result Learned operators capture regime shifts, with high-volatility regimes homogenizing transition dynamics.

The agent-based model of stock price dynamics on a directed evolving complex network is suggested and studied by direct simulation. The stationary regime is maintained as a result of the balance between the extremal dynamics, adaptivity of strategic variables and reconnection rules. The inherent structure of node agent…

2007-01-13abs ↗pdf ↗

A new algorithm learns optimal personalized treatment plans online with low regret.

problem Learning optimal dynamic treatment regimes in an online setting.
method Developed a novel algorithm balancing exploration and exploitation for rate-optimal regret.
result Guaranteed rate-optimal regret for linear transition and reward models.

New method quantifies uncertainty in fine-tuned LLMs using LoRA ensembles.

problem Uncertainty in fine-tuned LLMs and how to trust their predictions.
method Posterior approximations using low-rank adaptation ensembles.
result Unexpected retention of acquired knowledge during fine-tuning in overfitting regime.