New MAB model for online caching costs.
problem Learning costs of cached items online.
method Synchronization bandits, MirrorSync algorithm.
result Adversarial regret of for MirrorSync.
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 “cache synchronization”
This study investigates the use of reinforcement learning to guide a general purpose cache manager decisions. Cache managers directly impact the overall performance of computer systems. They govern decisions about which objects should be cached, the duration they should be cached for, and decides on which objects to ev…
A deep learning model predicts future cache accesses with high accuracy.
problem Improving cache management and performance through better prediction of future data accesses.
method Proposed a LSTM-based recurrent neural network model to predict future cache accesses using only a cache trace as input.
result The proposed model achieves high prediction accuracy and outperforms state-of-the-art practical policies.
Parrot learns optimal cache replacement policies using imitation learning.
problem Improving cache hit rates in complex access patterns.
method Imitation learning approach using Belady's oracle policy.
result Parrot increases cache hit rates by 61% on a web search benchmark.
Optimizes web page freshness with limited crawling frequencies.
problem Maximize local cache freshness given crawling frequency constraints.
method Three novel online estimation schemes for page change rates.
result Convergent algorithms for estimating page change rates.
DEAP Cache learns prefetching, eviction, and admission using machine learning.
problem Improving cache performance through better prefetching, eviction, and admission strategies.
method End-to-end pipeline using machine learning, inspired by pretraining on large corpora and online reinforcement learning.
result Optimal policy distribution between two orthogonal eviction strategies based on frequency and recency.
KVCOMM: Online Cross-context KV-cache Communication for Efficient LLM-based Multi-agent Systemscs.MA
KVCOMM optimizes multi-agent LLM systems by reusing KV-caches, reducing redundant processing.
problem Substantial overhead from reprocessing overlapping contexts across multi-agent systems.
method KVCOMM reuses KV-caches and adjusts offsets for shared content using a pool of cached examples (anchors).
result Achieves over 70% reuse rate across diverse multi-agent tasks, up to 7.8x speedup.
Support Vector Machines (SVMs) can solve structured multi-output learning problems such as multi-label classification, multiclass classification and vector regression. SVM training is expensive especially for large and high dimensional datasets. The bottleneck of the SVM training often lies in the kernel value computat…
We developed a caching method to speed up concept learning in complex knowledge bases.
problem Complex concept learning requires many instance retrieval calls, increasing runtime.
method Semantics-aware caching that links concepts to instances via crisp set operations.
result Our cache reduces concept retrieval and learning runtime by an order of magnitude.
Training large-scale image recognition models is computationally expensive. This raises the question of whether there might be simple ways to improve the test performance of an already trained model without having to re-train or fine-tune it with new data. Here, we show that, surprisingly, this is indeed possible. The …
Service-induced congestion in memory-constrained LLM serving
problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.
New algorithm improves cache management with delayed feedback and decaying costs.
problem Improving cache replacement policies with delayed and decaying costs feedback.
method Proposed EXP4-DFDC adaptive reinforcement learning algorithm.
result Expected regret is a vanishing quantity as a function of time.
AB-Cache: Training-Free Acceleration of Diffusion Models via Adams-Bashforth Cached Feature Reusestat.ML
New method speeds up diffusion models without sacrificing quality.
problem Slow inference in diffusion models.
method Adams-Bashforth method for caching and acceleration.
result Achieved nearly 3x speedup with maintained quality.
Due to the drastic increase of mobile traffic, wireless caching is proposed to serve repeated requests for content download. To determine the caching scheme for decentralized caching networks, the content preference learning problem based on mobility prediction is studied. We first formulate preference prediction as a …
This paper optimizes caching and model multiplexing for large model inference.
problem Resource consumption and latency challenges in large model deployment.
method Jointly optimizing a caching algorithm (GDSF or LEC) and a model multiplexer for large model inference.
result Achieves optimal rates in offline and online settings with up to 50x improvement over baseline.
A new method for energy-efficient file delivery in small cell networks.
problem Efficient resource management in femto-caching with time-variant statistical properties.
method Formulates a resource allocation problem as a stochastic knapsack problem and a multi-armed bandit problem, developing solutions for each.
result The proposed method maximizes the accumulated utility over the horizon, especially suitable for networks with time-variant statistical properties.
Machine learning models that take computer program source code as input typically use Natural Language Processing (NLP) techniques. However, a major challenge is that code is written using an open, rapidly changing vocabulary due to, e.g., the coinage of new variable and method names. Reasoning over such a vocabulary i…
Over the last few years, Deep Neural Networks (DNNs) have become ubiquitous owing to their high accuracy on real-world tasks. However, this increase in accuracy comes at the cost of computationally expensive models leading to higher prediction latencies. Prior efforts to reduce this latency such as quantization, model …
LATM framework uses LLMs to create and reuse tools for efficient problem-solving.
problem Improving problem-solving capabilities of LLMs with external tools.
method Closed-loop framework with two phases: tool making and tool using. LLMs act as both tool makers and users. Resource-intensive model for tool making, lightweight model for tool using.
result LATM framework achieves performance equivalent to using a powerful LLM for both roles but with significantly reduced costs.
In this paper, the distributed edge caching problem in fog radio access networks (F-RANs) is investigated. By considering the unknown spatio-temporal content popularity and user preference, a user request model based on hidden Markov process is proposed to characterize the fluctuant spatio-temporal traffic demands in F…
Typical large-scale recommender systems use deep learning models that are stored on a large amount of DRAM. These models often rely on embeddings, which consume most of the required memory. We present Bandana, a storage system that reduces the DRAM footprint of embeddings, by using Non-volatile Memory (NVM) as the prim…
FibQuant improves KV-cache compression for long-context inference.
problem Memory traffic bottleneck in long-context inference due to KV cache growth.
method Introduces FibQuant, a universal vector quantizer that combines Beta-quantile radii, Fibonacci/Roberts-Kronecker directions, and Lloyd-Max refinement.
result FibQuant achieves high compression rates with minimal loss in attention cosine similarity.
Novel higher-order group synchronization for noisy local measurements on hypergraphs.
problem Synchronizing higher-order local measurements on hyperedges to global estimates on nodes.
method Message passing algorithm for global synchronization of higher-order measurements.
result Higher-order method outperforms standard pairwise synchronization methods in certain applications.
New method uses neural networks for accurate angle estimation in noisy conditions.
problem Accurately estimate angles from noisy measurements in various applications.
method Directed Graph Neural Networks (GNNSync) for end-to-end trainable framework.
result GNNSync achieves competitive performance, even at high noise levels.
The sectoral synchronization observed for the Japanese business cycle in the Indices of Industrial Production data is an example of synchronization. The stability of this synchronization under a shock, e.g., fluctuation of supply or demand, is a matter of interest in physics and economics. We consider an economic syste…
Hybrid approach for large-scale network synchronization using KF and PTP.
problem Synchronization of large-scale networks in 5G.
method Combines Kalman Filtering and PTP for pairwise synchronization, and Factor Graphs and Belief Propagation for end-to-end synchronization.
result Error in offset estimation remains below 5 ns in simulations.
We analyze how an observer synchronizes to the internal state of a finite-state information source, using the epsilon-machine causal representation. Here, we treat the case of exact synchronization, when it is possible for the observer to synchronize completely after a finite number of observations. The more difficult …
We address challenges of active learning under scarce informational resources in non-stationary environments. In real-world settings, data labeled and integrated into a predictive model may become invalid over time. However, the data can become informative again with switches in context and such changes may indicate un…
Research optimizes C++ patterns for HFT, reducing latency and improving profitability.
problem Optimizing latency-critical code for high-frequency trading systems.
method Creation of a Low-Latency Programming Repository, optimisation of trading strategy, implementation of Disruptor pattern.
result Significant performance improvements in speed and profitability.
New algorithm uses PSO to optimize DNN training parameters in distributed systems.
problem Reducing synchronization frequency in DNN training leads to poor convergence.
method Integrates PSO into distributed training to automatically compute new parameters.
result Proposed algorithm outperforms synchronous methods in distributed DNN training.
ShadowSync: Performing Synchronization in the Background for Highly Scalable Distributed Trainingcs.LG
ShadowSync separates background synchronization for scalable distributed training.
problem Reducing synchronization overhead in distributed training for high scalability.
method Separates synchronization from training and runs it in the background.
result Achieves both high throughput and excellent model quality at scale.
This paper is about metric data structures in high-dimensional or non-Euclidean space that permit cached sufficient statistics accelerations of learning algorithms. It has recently been shown that for less than about 10 dimensions, decorating kd-trees with additional "cached sufficient statistics" such as first and sec…
New method synchronizes graphs with probability measures on rotations.
problem Synchronizing graphs with measure-valued edges over rotations.
method Formulated as maximization of cycle-consistency in probability measures over rotations, using Sinkhorn divergences.
result Proposes a nonparametric Riemannian particle optimization approach converging to global optimum under certain conditions.
Predicting the State of Synchronization of Financial Time Series using Cross Recurrence Plotsq-fin.ST
Study predicts synchronization state of financial time series using cross-recurrence plots.
problem Predicting the state of synchronization of financial time series.
method Cross-correlation analysis and deep learning framework for predicting synchronization state based on cross-recurrence plots.
result Satisfactory performance in predicting synchronization state for certain pairs of stocks.
This paper proposes a general model for synchronized crowding behavior. An order parameter is introduced to quantify the level of synchronization which is shown a function of percentage of agents in reactive state. Further, synchronization is shown to be driven by the most active agents with the highest volatility. A t…
Efficiently estimates rotations with corrupted data.
problem Rotation synchronization under high corruption and noise.
method Message passing algorithm with reweighted least squares.
result Superior performance over state-of-the-art methods.
Study optimizes estimation of orthogonal and rotation matrices from noisy data.
problem Estimating orthogonal and rotation matrices from noisy data.
method Iterative polar decomposition algorithm initialized by spectral methods.
result Algorithm achieves optimal error rate of $(1+o(1)) rac{σ^2 d(d-1)}{2np}$.
Solves complex clustering and rotation synchronization problem.
problem Challenges in classifying and synchronizing rotated objects into multiple categories.
method Semidefinite programming relaxations to solve the joint problem of community detection and synchronization.
result Exact recovery of community detection and synchronization when extending stochastic block model.
Spectral method for joint community detection and group synchronization.
problem Jointly detecting communities and synchronizing orthogonal groups in graphs.
method Spectral decomposition followed by CPQR factorization.
result Near-optimal guarantees for exact and stable recovery of cluster memberships and orthogonal transforms.
Study financial markets using synchronization measures and clustering algorithms.
problem Analyze high-frequency trading dynamics and market states.
method Ordinal pattern series, information-theoretic synchronization measure, clustering algorithms, Markov model.
result Identify two coherent seasons of centralized and decentralized synchronicity.
Spectral methods achieve near-optimal performance in orthogonal and permutation group synchronization.
problem Recovering group elements from pairwise measurements in computer vision.
method Spectral methods applied with the leave-one-out technique.
result Near-optimal performance bounds for orthogonal and permutation group synchronization established.
Networks of coupled dynamical systems provide a powerful way to model systems with enormously complex dynamics, such as the human brain. Control of synchronization in such networked systems has far reaching applications in many domains, including engineering and medicine. In this paper, we formulate the synchronization…
Machine learning predicts synchronization transitions in unknown systems.
problem Predicting synchronization transitions in systems with unknown equations.
method Developed a 'parameter-aware' machine learning scheme using reservoir computing or echo state networks.
result Machine learning accurately predicts synchronization transitions, including hysteresis loops.
New method linearizes nonlinear coupled oscillators on graphs.
problem Predicting global synchronization in nonlinear coupled oscillators on graphs.
method Latent dynamic filters learned through supervised matrix factorization.
result Latent dynamics filters enable effective prediction of global synchronization.
New approach predicts stock price synchronization using RNNs and LSTMs.
problem Forecasting synchronization of stock prices in the Indian market.
method Utilizing recurrence plots and CRQA for non-linear analysis, RNNs and LSTMs for prediction.
result Accuracy of 0.98 and F1 score of 0.83 in predicting stock price synchronization.
Adaptive synchronization improves deep reinforcement learning performance.
problem Fixed step size synchronization can cause loss of properly learned networks.
method Adaptive synchronization based on recent agent behavior.
result Adaptive synchronization leads to better performance in games.
Low power digital signal processors (DSPs) typically have a very limited amount of memory in which to cache data. In this paper we develop efficient bottleneck feature (BNF) extractors that can be run on a DSP, and retrain a baseline large-vocabulary continuous speech recognition (LVCSR) system to use these BNFs with o…
KuramotoGNN uses Kuramoto model to prevent over-smoothing in graph neural networks.
problem Over-smoothing in graph neural networks where node features become indistinguishable.
method Integrates Kuramoto model to prevent phase synchronization and instead achieve frequency synchronization.
result KuramotoGNN reduces over-smoothing on various graph deep learning tasks.