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

199398597796 · Jun 202019922001200920172026
48 results for KPI optimization

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.

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.

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 ↗

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.

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 ↗

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 ↗

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.

Optimizes antenna tilt for better QoS in cellular networks.

problem Hard to learn optimal antenna tilt policies in real networks due to risk and simulation gap.
method Uses off-policy Contextual Multi-Armed-Bandit (CMAB) techniques to learn from existing data.
result Trained policies show consistent improvements over existing logging policies.

Survival strategy for crypto firms in bear markets using BTC-to-sats payments rail.

problem Downside risk in crypto reserves during bear markets.
method Conservative treasury policy, operating line monetizing holdings, BTC-to-sats payments rail.
result Sustained mNAV premium through cycles with disclosed KPIs.

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.

CJE calibrates cheap LLM judges against an oracle, achieving high accuracy at a fraction of the cost.

problem Inexpensive LLM judges can produce biased rankings, leading to unreliable outcomes.
method CJE uses a small oracle to calibrate cheap scores, then evaluates at scale with valid uncertainty.
result CJE achieves 99% pairwise ranking accuracy at 14x lower cost compared to a 16x oracle/judge cost ratio.

Bayesian optimization reduces computational effort in aircraft design optimization.

problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.

Bayesian optimization method tackles combinatorial spaces, scalable for large data.

problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.

New algorithm solves complex stopping problems with robust optimization.

problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.

When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…

2018-02-06abs ↗pdf ↗

New algorithms ensure reproducibility and optimal convergence in convex optimization.

problem Trade-off between reproducibility and convergence rate in convex optimization.
method Regularization-based algorithms for smooth convex minimization and minimax optimization.
result Achieves optimal reproducibility and near-optimal gradient complexity for various oracle settings.

This paper shows how to combine optimal tests into log-optimal processes.

problem How to combine optimal sequential tests into log-optimal processes.
method Using a new class of WAIT e-processes, the paper aggregates asymptotically optimal sequential tests into asymptotically log-optimal processes.
result It is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes.

New algorithm AG-OG optimizes separable convex-concave problems efficiently.

problem Efficiently solving separable convex-concave minimax optimization problems.
method Leverages Nesterov acceleration and optimistic gradient on component and coupling parts of the problem.
result Achieves optimal convergence rate for various settings including bilinearly coupled problems.

Adapts Bayesian optimization for mixed constraints in aircraft design.

problem Optimizing expensive black box functions with mixed constraints.
method Super efficient global optimization with upper trust bound for constraints, Gaussian process uncertainty, refinement procedure.
result Superior performance on aircraft design problem compared to state-of-the-art solvers.

BOSH optimizes functions with stochastic evaluations more efficiently and precisely.

problem Optimizing functions with noisy evaluations can lead to suboptimal solutions.
method BOSH uses a hierarchical Gaussian process to generate a growing pool of realizations.
result BOSH provides more efficient and higher-precision optimization than standard BO.

New learned optimizers outperform baselines by incorporating known and novel mechanisms.

problem Understanding how learned optimizers outperform traditional ones.
method Careful analysis and visualization of learned optimizers trained on various tasks.
result Learned optimizers incorporate known techniques like momentum and gradient clipping, as well as new forms of learning rate adaptation.

Develops a new method for efficient stochastic bilevel optimization.

problem Stochastic bilevel optimization problems in machine learning applications.
method Single-Timescale stochAstic BiLevEl optimization (STABLE) method.
result Achieves the same order of sample complexity as stochastic gradient descent for single-level optimization.