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

Trend · papers per month

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for power efficiency

SEFR is a fast, energy-efficient classifier for ultra-low power devices.

problem Running machine learning on battery-powered devices is challenging due to time and energy constraints.
method SEFR is an ultra-low power classifier with linear time complexity for training and testing.
result SEFR is 63 times faster and 70 times more energy efficient than state-of-the-art classifiers.

This paper tackles energy-efficient machine learning on low-power devices.

problem Energy consumption in machine learning due to data communication.
method Dynamic averaging for integer exponential families on low-power processors.
result Achieves comparable model quality with significantly less communication and energy.

Optimizes energy efficiency in wireless sensor networks with limited information.

problem Maximizing energy efficiency in energy harvesting wireless sensor networks with limited channel state information.
method Modeling as a Multi-Armed Bandits problem and developing an Upper Confidence Bound algorithm.
result Significant gains in energy efficiency compared to benchmark schemes.

Study on time-zero efficiency of European power derivatives markets using statistical tests and trading rules.

problem Assessing time-zero efficiency in European power derivatives markets.
method Statistical tests based on the law of one price and trading rules based on price differentials and no-arbitrage violations applied to daily data of three European power markets.
result Definite conclusions on time-zero efficiency are not possible for French and Spanish markets due to liquidity and representativeness challenges.

Review of efficient neural networks for TinyML on resource-constrained devices.

problem Resource constraints on ultra-low power MCUs for deep learning models.
method Model compression, quantization, low-rank factorization, model pruning, hardware acceleration, algorithm-architecture co-design.
result Optimized neural network architectures for minimal resource utilization on MCUs.

In this paper, we resolve many of the key algorithmic questions regarding robustness, memory efficiency, and differential privacy of tensor decomposition. We propose simple variants of the tensor power method which enjoy these strong properties. We present the first guarantees for online tensor power method which has a…

2016-06-20abs ↗pdf ↗

FPPI selectively uses predictions to improve inference efficiency.

problem Improving statistical inference with limited labeled data and heterogeneous prediction quality.
method Filtered Prediction-Powered Inference (FPPI) framework.
result FPPI achieves strictly improved asymptotic efficiency compared to existing methods.

Value functions struggle to represent transition dynamics, impacting statistical efficiency.

problem Limited representational power of value functions in capturing transition dynamics.
method Case studies of various reinforcement learning problems to explore the limitations of value-based methods.
result Value-based methods can be as efficient as model-based ones in some cases but severely underperform in others due to information loss.

The increasing importance of renewable energy, especially solar and wind power, has led to new forces in the formation of electricity prices. Hence, this paper introduces an econometric model for the hourly time series of electricity prices of the European Power Exchange (EPEX) which incorporates specific features like…

2014-02-27abs ↗pdf ↗

Study improves treatment effect estimation using unlabeled covariates.

problem Estimating treatment effects with limited labeled data.
method Developed efficiency bounds and estimators for semi-supervised setting.
result Estimators using unlabeled covariates have lower asymptotic variance.

New method finds significant high-order interactions efficiently.

problem Finding statistically significant high-order interactions in high-dimensional data.
method Extends selective inference to high-order interaction models with pruning strategy.
result Demonstrated efficient and powerful method for high-order interactions.

PPI++ uses machine learning predictions to improve inference from small datasets.

problem Efficient inference from small labeled datasets with high-quality predictions.
method Adapts prediction-powered inference (PPI) to compute confidence sets for any parameter dimensionality.
result Improves classical intervals using only labeled data, always yielding better results.

Non-intrusive load monitoring or energy disaggregation involves estimating the power consumption of individual appliances from measurements of the total power consumption of a home. Deep neural networks have been shown to be effective for energy disaggregation. In this work, we present a deep neural network architectur…

2018-12-10abs ↗pdf ↗

Deep learning's success requires vast computing power, making future progress unsustainable.

problem Deep learning's success is heavily dependent on computing power, making future progress unsustainable.
method Cataloging and extrapolating the dependency on computing power for various deep learning applications.
result Continued progress in deep learning applications will require more computationally-efficient methods.

Proposes DR-ME test for interpretable distributional treatment effects.

problem Detects invisible differences in treatment effects on distributional outcomes.
method Semiparametrically efficient finite-location test using kernel witnesses and orthogonal features.
result DR-ME reveals causal-discrepancy coordinates and has noncentral chi-square local power.

Optimizes data power control in cell-free networks for better spectral efficiency.

problem Maximizing overall spectral efficiency in cell-free networks with multi-objective optimisation.
method Applied scalable multi-objective Bayesian optimisation to solve convergence-time limitations.
result Improved radio resource management in cell-free networks.

New metrics improve quantum ensemble learning efficiency and power.

problem Quantum ensembles' distances poorly understood due to measurement constraints.
method Introduce MMD-kk hierarchy of integral probability metrics for quantum ensembles.
result MMD-kk requires fewer samples for full discriminative power at higher kk.

Prediction-powered causal inference achieves smaller asymptotic variance than traditional methods.

problem Estimating causal and structural parameters in a semi-supervised setting.
method Combining efficient influence function with debiased machine learning and semi-supervised Riesz regression.
result Asymptotic variances of estimators match the derived efficiency bound.

FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.

problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.

Paper proposes a fast data-driven AC-OPF method using sparse hybrid Gaussian processes.

problem Optimizing electricity generation and delivery under generation uncertainty in modern power grids.
method Data-driven approach using sparse hybrid Gaussian processes to model power flow equations.
result Shows up to two times faster and more accurate solutions compared to state-of-the-art methods.

We propose a mean field game model to study the question of how centralization of reward and computational power occur in Bitcoin-like cryptocurrencies. Miners compete against each other for mining rewards by increasing their computational power. This leads to a novel mean field game of jump intensity control, which we…

2019-12-04abs ↗pdf ↗

Generalizes prediction-powered inference for binary classifier evaluation.

problem Evaluation of binary classifiers with partially observed outcomes.
method Generalizes PPI to any regular asymptotically linear estimator and proposes modified estimators for covariate shift.
result PPI can be a computationally-simple alternative to existing methods, achieving no greater than the semi-parametric efficiency lower bound in certain scenarios.

We analyze the European transition economies and show that time series for most of major indices exhibit (i) power-law correlations in their values, power-law correlations in their magnitudes, and (iii) asymmetric probability distribution. We propose a stochastic model that can generate time series with all the previou…

2006-08-02abs ↗pdf ↗

Regularization is used to find a solution that both fits the data and is sufficiently smooth, and thereby is very effective for designing and refining learning algorithms. But the influence of its exponent remains poorly understood. In particular, it is unclear how the exponent of the reproducing kernel Hilbert space~(…

2013-10-09abs ↗pdf ↗

MoEs can efficiently model complex tasks with low-dimensionality and sparsity.

problem Understanding the theoretical foundations of MoEs for complex tasks.
method Systematic study of MoEs with two structural priors: low-dimensionality and sparsity.
result MoEs can approximate functions on low-dimensional manifolds and exhibit exponential structured tasks.

This research simplifies computation of feature attribution methods under certain conditions.

problem Computational complexity of feature attribution methods, especially power indices.
method Identifying conditions for polynomial computation and introducing new indices.
result Conditions for efficient computation of feature attribution methods are identified.