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,657 papers · 148 categories

Trend · papers per month

16324763 · May 202619922001200920172026
48 results for RAN KPI forecasting

QBSD optimizes KPI forecasting for RAN networks with fast runtime and accuracy.

problem Efficiently forecasting KPIs for RAN networks with dynamic operating ranges.
method Quartile-Based Seasonality Decomposition (QBSD) for live single-step forecasting.
result QBSD outperforms other methods in runtime efficiency and forecast accuracy.

Proposes a Big Data framework for SC forecasting, including data preprocessing and machine learning.

problem Improving SC forecasting accuracy and efficiency.
method Data collection, preprocessing, machine learning model training, hyperparameter tuning, performance evaluation.
result Optimized SC forecasting models enhance workforce, inventory, and overall SC performance.

A lightweight model predicts IT system KPIs from historical data.

problem Predicting future KPIs of interconnected IT systems is hard due to diverse and changing components.
method A weighted heterogeneous ensemble method combining neural network and mean predictor.
result Achieved R2R^2 scores of 0.10 and 0.15 on test data.

We present a comparative study of different probabilistic forecasting techniques on the task of predicting the electrical load of secondary substations and cabinets located in a low voltage distribution grid, as well as their aggregated power profile. The methods are evaluated using standard KPIs for deterministic and …

2019-10-03abs ↗pdf ↗

A PID-based feedback-control system improves multiple KPIs in RTB display advertising.

problem Challenges in simultaneously improving multiple KPIs in RTB campaigns.
method Sequential Control using PID-based feedback and importance metrics.
result Effective in simultaneously controlling multiple KPIs in both simulations and live traffic.

This paper reviews and compares deep generative models for financial time series and VaR.

problem Forecasting risk factor distribution in financial markets.
method Apply multiple deep generative models (CGAN, CWGAN, Diffusion, Signature WGAN) and propose new methods for conditional time series generation.
result Top performing models are Historical Simulation, GARCH, and CWGAN.

YC Bench forecasts startup success in Y Combinator batches with a short-term metric.

problem Difficult forecasting of startup success due to sparse meaningful outcomes and slow evaluation cycles.
method Developed a live benchmark using publicly available traction signals and web visibility metrics.
result Revealed 6 out of 11 top performers at YC Demo Day with a simple proxy for prior brand recognition.

PS-DME evaluates model performance and reliability after data-dependent selection.

problem Evaluating model performance and reliability when data is used for selection and evaluation.
method Post-selection distributional model evaluation (PS-DME) using e-values to control false coverage rate.
result PS-DME provides reliable comparison of model configurations across different reliability levels.

Time series anomaly detection is usually formulated as finding outlier data points relative to some usual data, which is also an important problem in industry and academia. To ensure systems working stably, internet companies, banks and other companies need to monitor time series, which is called KPI (Key Performance I…

2018-12-20abs ↗pdf ↗

Introduces new spaces for configurations of points with specific monodromies.

problem Configurations of points with specific monodromies in complex plane subspaces.
method Introduces Hurwitz-Ran spaces for configurations of points in XY\mathcal{X}\setminus\mathcal{Y} and Y\mathcal{Y} with monodromies in Q\mathcal{Q} and GG.
result Proves homeomorphism between Hurwitz-Ran spaces and simplicial Hurwitz spaces.

RAN model recognizes multiple activities from unlabeled sensor data.

problem Handling weakly labeled multi-activity data from wearable sensors.
method Recurrent Attention Networks (RAN) for sequential multi-activity recognition and localization.
result RAN model can infer multiple activities and determine activity locations from unlabeled data.

Study proposes new methods to calculate probabilistic benchmarks in noisy data.

problem Identifying opportunities for improvement in comparable units with noisy data.
method 2-step methodology involving undersampling and relevance vector machine.
result Higher discrimination power achieved with macro-economic environment variables.

Proposes a new model for RANS simulations with uncertainty.

problem Uncertainty in Reynolds-averaged Navier-Stokes simulations.
method Data-driven closure model with aleatoric uncertainty, Bayesian formulation, sparse indirect data.
result Accurate probabilistic predictions, even in regions of model error.

Paper proposes RAN for better anomaly detection in time series data.

problem Anomaly detection algorithms often fail to accurately detect anomalies due to incomplete reconstruction of anomaly data.
method RAN uses adversarial learning and latent vector-constrained Autoencoder to ensure consistent reconstruction of anomaly data.
result RAN outperforms other algorithms in detecting meaningful anomalies with higher AUC-ROC scores.

Bayesian optimization outperformed random search in machine learning hyperparameter tuning challenge.

problem Optimizing hyperparameters of machine learning models using derivative-free methods.
method Bayesian optimization vs. random search on real datasets.
result Bayesian optimization significantly outperformed random search in held-out objective functions.

Many applications, including natural language processing, sensor networks, collaborative filtering, and federated learning, call for estimating discrete distributions from data collected in batches, some of which may be untrustworthy, erroneous, faulty, or even adversarial. Previous estimators for this setting ran in e…

2019-11-19abs ↗pdf ↗

Markov networks are widely used in many Machine Learning applications including natural language processing, computer vision, and bioinformatics . Learning Markov networks have many complications ranging from intractable computations involved to the possibility of learning a model with a huge number of parameters. In t…

2018-12-03abs ↗pdf ↗

Constructs hyperbolic surfaces with small eigenvalues.

problem Finding hyperbolic surfaces with eigenvalues below a given threshold.
method Geometric proof using techniques from B.Randol's 1974 paper.
result Constructs closed hyperbolic covering surfaces with eigenvalues less than any small positive number ε.

GABI learns geometry from diverse systems to improve Bayesian inference.

problem Bayesian inversion of physical systems with varying geometries.
method Geometric Autoencoders for Bayesian Inversion (GABI) learns geometry-aware priors from large datasets.
result GABI yields comparable predictive accuracy to deterministic methods and well-calibrated uncertainty quantification.

Paper uses CNN to predict stock price movement as an image classification problem.

problem Predicting stock price movement using machine learning.
method CNN-based model for classifying stock price movement based on the first hour of trading.
result The algorithm effectively separated between stock price movement classes and outperformed other strategies.

Study compares deep learning stock trading strategies in adverse market conditions.

problem Comparing deep learning models for stock trading performance in extreme market downturns.
method Reconstructed three deep learning models and compared their strategies through trading simulations.
result Deep learning models, especially LSTM, can mitigate losses in severe market downturns.

Motivated by an abstract notion of low-level edge detector filters, we propose a simple method of unsupervised feature construction based on pairwise statistics of features. In the first step, we construct neighborhoods of features by regrouping features that correlate. Then we use these subsets as filters to produce n…

2013-12-20abs ↗pdf ↗

The ad-trading desks of media-buying agencies are increasingly relying on complex algorithms for purchasing advertising inventory. In particular, Real-Time Bidding (RTB) algorithms respond to many auctions -- usually Vickrey auctions -- throughout the day for buying ad-inventory with the aim of maximizing one or severa…

2015-11-26abs ↗pdf ↗

Formula conjectured for rational cuspidal curves in projective plane.

problem Counting rational cuspidal curves in projective plane.
method Extending Kontsevich's recursion formula and using geometric input about tangency of curves at nodal points.
result Conjectural formula agrees with earlier computations and extends to rational quartics with E6 singularity.