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

Trend · papers per month

0111 · Sep 201819922001200920172026
14 results for Power-Performance

Study evaluates RKHS choices for assessing graph models using KSD tests.

problem Effect of RKHS choice on KSD tests for graph model assessment.
method Investigated power performance and computational runtime of KSD tests for ERGMs and synthetic graph generators.
result Different RKHS choices affect KSD test performance and computational runtime.

Paper proposes using generalized lambda distributions for stochastic simulators.

problem Uncertainty quantification with complex stochastic models is computationally challenging.
method Flexible generalized lambda distribution approximates response PDF, parameters are sparse polynomial chaos expansions.
result Local inference of response PDF at each point of experimental design using replicated model evaluations.

Paper detects and estimates breaks in high-dimensional functional time series.

problem Detecting and estimating structural breaks in heterogeneous mean functions of high-dimensional functional time series.
method Proposes a new test statistic combining functional CUSUM and power enhancement components, with a clustering algorithm for group structure estimation.
result The proposed techniques have satisfactory performance in finite samples, detecting and estimating breaks effectively.

Paper presents an algorithm to analyze DGNNs by identifying generative boundaries and sampling.

problem Challenges in identifying the generation mechanism of DGNNs.
method Explorative sampling algorithm to analyze DGNNs by defining generative boundaries and optimizing essential set.
result Empirically reveals the characteristics of DGNNs' internal layers and finds more homogeneous samples.

The paper analyzes the trade-off between smoothness and sparsity in GCN using lp-regularized learning.

problem Quantifying the trade-off between smoothness and sparsity in GCN.
method Proposes a novel SGD proximal algorithm for GCNs with an inexact operator to analyze the stability of the p\ell_p-regularized stochastic learning.
result Establishes an explicit theoretical understanding of GCN with p\ell_p-regularized stochastic learning.

Study evaluates 31 performance predictors in NAS, recommending best for different settings.

problem Understanding and comparing different performance prediction techniques in NAS.
method Analysis of 31 techniques, testing correlation and rank-based measures, speed-up potential.
result Certain predictor families can be combined for better predictive power.