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.

169,051 papers · 148 categories

Trend · papers per month

14.7%29.5%44.2%58.9% · Jun 202019922001200920172026
48 results for intermittent learning

Paper tackles intermittent learning for energy-constrained machine learning tasks.

problem Energy-constrained machine learning tasks on intermittently powered systems.
method Developed an algorithm and heuristics for efficient learning under energy constraints.
result Improves energy efficiency by up to 100% and reduces learning examples by up to 50%.

Federated learning algorithm improves with intermittent client availability.

problem Performance degradation in Federated Averaging due to client availability changes.
method Federated Latest Averaging (FedLaAvg) uses latest gradients from all clients, even when unavailable.
result FedLaAvg achieves sublinear speedup compared to classical Federated Averaging.

The study uses Gaussian Processes with Tweedie likelihood for forecasting intermittent time series.

problem Forecasting intermittent time series with high accuracy and flexibility.
method The approach combines Gaussian Processes with two forecast distributions: negative binomial and Tweedie.
result TweedieGP provides better probabilistic forecasts, especially for high quantiles.

Global models outperform local models in forecasting intermittent time series.

problem Forecasting intermittent time series with zeros in supply chains.
method Comparison of state-of-the-art probabilistic local and global models on five datasets.
result TiDE, a simple neural network architecture, achieves the best accuracy among global models.

A new Bayesian model improves forecasting for intermittent demand.

problem Sparse observations, cold-start items, and obsolescence in intermittent demand forecasting.
method Hierarchical Bayesian TSB model with partial pooling and calibrated probabilistic configuration.
result TSB-HB achieves the lowest RMSE and RMSSE on the UCI Online Retail dataset.

Proposes a pricing agent using reinforcement learning to balance renewable energy demand.

problem Intermittent renewable energy sources challenge carbon-free electricity generation.
method Reinforcement learning approach to balance customer demand with renewable energy generation.
result Demonstrates improved electricity pricing strategy for renewable energy integration.

A new metric optimizes forecasts for lumpy, intermittent demand.

problem Inaccurate demand forecasts lead to suboptimal logistics and production.
method Developed a novel metric that considers both statistical and business aspects.
result The new metric yields more accurate predictions for lumpy and intermittent demand.

A new model captures multifractal volatility in stock returns.

problem Capturing multifractal volatility in stock returns.
method Introduced mLog S-fBM model, defined mS-fBM, and developed calibration procedure.
result Model captures multifractal behavior in stock returns, validating on real data.

A new model captures multifractal volatility in stock returns.

problem Capturing multifractal volatility in stock returns.
method Introduced mLog S-fBM model, defined mS-fBM, and developed calibration procedure.
result Validated model on synthetic and real data, showing multifractal behavior.

Factorial moments are convenient tools in nuclear physics to characterize the multiplicity distributions when phase-space resolution (ΔΔ) becomes small. For uncorrelated particle production within ΔΔ, Gaussian statistics holds and factorial moments FqF_q are equal to unity for all orders qq. Correlations between par…

2011-08-29abs ↗pdf ↗

Sharp heat kernel estimates on manifolds lead to solutions of the Parabolic Anderson model.

problem Well-posedness and intermittency of solutions to the Parabolic Anderson model on Riemannian manifolds.
method Sharp global heat kernel bounds and geodesic comparison geometry.
result Upper and lower moment bounds for solutions of the Parabolic Anderson model on general compact Riemannian manifolds.

SurvSurf predicts first hitting times for intermittent events without monotonic violations.

problem Predicting first hitting times for intermittent events with monotonicity guarantees.
method Partially monotonic neural network for sequential events, incorporating unobserved events.
result SurvSurf outperforms existing models in MSE and IBS metrics.

Paper addresses state estimation in sensor networks with intermittent data.

problem State estimation in sensor networks with packet dropouts and corrupted observations.
method Bayesian variational inference with a dual-mask generative model.
result The method effectively identifies system states and noise parameters.

Paper shows local SGD outperforms mini-batch SGD under certain conditions.

problem Proving local SGD's superiority in distributed learning with heterogeneous data.
method New lower and upper bounds for local SGD under first-order heterogeneity assumptions.
result Local SGD is min-max optimal under certain conditions, resolving understanding of distributed optimization.

The Minority Game framework was recently generalized to account for the possibility that agents adapt not only through strategy selection but also by diversifying their response according to the kind of dynamical regime, or the risk, they perceive. Here we study the effects of this mechanism in different information st…

2005-03-31abs ↗pdf ↗

Paper optimizes FL communication efficiency with stochastic optimization.

problem Intermittent connectivity and non-i.i.d. data in FL.
method Convergence analysis of non-convex loss functions, stochastic optimization for client selection and power allocation.
result Significant reduction in communication time compared to random participation.

We consider several estimation and learning problems that networked agents face when making decisions given their uncertainty about an unknown variable. Our methods are designed to efficiently deal with heterogeneity in both size and quality of the observed data, as well as heterogeneity over time (intermittence). The …

2016-11-10abs ↗pdf ↗

A new method reduces communication in Federated Learning by pulling less often.

problem Reducing communication overhead in Federated Learning.
method Pulling Reduction with Local Compensation (PRLC) for SGD.
result PRLC achieves lower pulling frequency and maintains the same convergence rate as synchronous SGD.

Study shows increased precipitation variability in Paris area over years.

problem Evaluating the evolution of precipitation variability over time.
method Shape-based Dynamic Time Warping (IMS-DTW) for clustering rainfall time series.
result Precipitation variability increased in Paris area over years.

ACI uses Bayesian data assimilation to trace causes from effects in complex systems.

problem Capturing instantaneous, time-evolving causal relationships in complex, high-dimensional systems.
method Assimilative causal inference (ACI) leverages Bayesian data assimilation to trace causes backward from observed effects.
result ACI provides online tracking of causal roles that may reverse intermittently and reveals how far effects propagate.

In this paper, we show how simple logistic growth that was studied intensively during the last 200 years in many domains of science could be extended in a rather simple way and with these extensions is capable to produce a collection of behaviors widely observed in an enormous number of real-life systems in Economics, …

2008-02-24abs ↗pdf ↗

Study on collaborative vs. non-collaborative online and bandit convex optimization.

problem Minimizing average regret in distributed online and bandit convex optimization.
method Analyzes the impact of collaboration in adaptive and zeroth-order feedback settings.
result Collaboration is beneficial in high-dimensional federated online optimization with limited feedback.

Minibatch SGD outperforms Local SGD in heterogeneous distributed learning.

problem Optimizing a combined convex objective with stochastic gradient estimates from different machines.
method Analysis of Minibatch SGD and Local SGD in a heterogeneous distributed setting.
result Minibatch SGD dominates Local SGD in the heterogeneous distributed setting.

The formation of price in a financial market is modelled as a chain of Ising spin with three fundamental figures of trading. We investigate the time behaviour of the model, and we compare the results with the real EURO/USD change rate. By using the test of local Poisson hypothesis, we show that this minimal model leads…

2006-01-09abs ↗pdf ↗

We find empirically a characteristic sharp peak-flat trough pattern in a large set of commodity prices. We argue that the sharp peak structure reflects an endogenous inter-market organization, and that peaks may be seen as local ``singularities'' resulting from imitation and herding. These findings impose a novel strin…

1998-02-23abs ↗pdf ↗

This study investigates self-organizing dynamics in a stochastic exponential DAM model using Temporal Complexity.

problem Understanding self-organizing behavior in artificial neural systems.
method Investigation of a stochastic exponential DAM model through Temporal Complexity analysis.
result The model exhibits regimes of complex intermittency with nontrivial temporal correlations and scale-free behavior.

SPECTRA improves probabilistic energy forecasting by separating trends and uncertainties.

problem Interacting uncertainties from renewable intermittency, demand flexibility, market volatility, and weather impact probabilistic forecasts.
method Adaptive state-space exogenous context and temporal-frequency resolution architecture.
result Achieved best CRPS in 14 out of 18 settings, reducing CRPS by 5.74% and upper-tail quantile risk by 7.27%.

A new asynchronous method for vertical federated learning improves privacy and efficiency.

problem Solving vertical federated learning in an asynchronous manner with privacy and efficiency.
method A simple FL method that allows clients to run stochastic gradient algorithms asynchronously with a new perturbed local embedding technique.
result The method improves privacy and communication efficiency compared to centralized and synchronous FL methods.

DynBRO learns robustly from dynamic Byzantine workers.

problem Fault-tolerant distributed learning with dynamic Byzantine workers.
method Multi-level Monte Carlo (MLMC) gradient estimation and adaptive learning rate.
result DynaBRO nearly matches static setting's convergence rate with O(T)\mathcal{O}(\sqrt{T}) Byzantine worker changes.

A new decentralized deep learning method reduces communication costs without sacrificing accuracy.

problem Efficient decentralized deep learning with reduced communication costs.
method Layer-wise federated group ADMM (L-FGADMM) with adjusted communication periods for different layers.
result By skipping the largest layer consensus, L-FGADMM achieves similar test accuracy to federated learning with significantly reduced communication cost.

We study a phenomenological model for the continuous double auction, equivalent to two independent M/M/1M/M/1 queues. The continuous double auction defines a continuous-time random walk for trade prices. The conditions for ergodicity of the auction are derived and, as a consequence, three possible regimes in the behavior …

2013-05-13abs ↗pdf ↗

Kaggle competitions offer valuable insights for business forecasting.

problem Lack of attention to Kaggle competitions in academic forecasting studies.
method Review of results from six Kaggle competitions featuring real-life business forecasting tasks.
result Global ensemble models outperform local single models in Kaggle competitions.

New algorithm reduces sample and communication complexities in federated Q-learning.

problem Optimal Q-function learning in federated Q-learning with limited communication.
method Introduced Fed-DVR-Q algorithm for order-optimal sample and communication complexities.
result Complete characterization of sample-communication complexity trade-off.