Linear cost method approximates Gaussian Matérn processes with exponentially convergent accuracy.
problem High computational cost for Gaussian process inference and prediction.
method Optimal rational approximation of spectral density for Gaussian processes on bounded intervals.
result Exponential decrease in covariance error with increasing order of approximation.
This work proposes a way to align statistical modeling with decision making. We provide a method that propagates the uncertainty in predictive modeling to the uncertainty in operational cost, where operational cost is the amount spent by the practitioner in solving the problem. The method allows us to explore the range…
THORS converts arbitrary classifiers to cost-sensitive ones efficiently.
problem Making classifiers cost-sensitive without extensive knowledge.
method THORS uses order statistics to find optimal thresholds.
result THORS provides theoretical guarantees and lower time complexity.
New methods improve statistical accuracy of complex models without high computational cost.
problem Improving statistical accuracy of complex models without high computational cost.
method Neural posterior and likelihood estimation (NPE and NLE) methods.
result NPE and NLE methods have similar theoretical guarantees to ABC and BSL, but achieve accuracy at a reduced computational cost.
New sparsification technique for SGD reduces communication costs.
problem High communication costs in distributed SGD for large-scale models.
method Statistical estimation model for sparsity and skewness of stochastic gradients.
result Concatenated top-k and random-k sparsification outperforms individual methods.
Paper proposes efficient communication scheme for statistical learning.
problem Efficiently conveying a statistical hypothesis from a client to a server.
method Joint training and source coding scheme with KL divergence constraints.
result Guarantees small average empirical risk, generalization error, and communication cost.
Deep Hedging learns risk-neutral vol dynamics for option pricing.
problem Statistical arbitrage in market dynamics without transaction costs.
method Numerical approach to train market simulator and find risk-neutral density.
result Risk-neutral model for stochastic implied volatility can be used for pricing or Deep Hedging.
This study optimizes trading and arbitrage in decentralized finance's CPMs, revealing convexity costs and developing efficient strategies.
problem Optimizing trading and arbitrage in decentralized finance's constant product markets (CPMs).
method Developed models for CPMs in competing centralised exchanges, CPMs, and both venues. Derived computationally efficient strategies.
result Accurately estimated convexity costs in CPMs, which are linear in trade size and nonlinear in liquidity depth and exchange rate.
Researchers analyze the relationship between ML cost functions and the C-index in survival analysis.
problem Understanding the relationship between ML cost functions and the C-index in survival analysis.
method Provided C-index Fisher-consistency results and excess risk bounds for various cost functions in survival analysis.
result Identified conditions under which ML cost functions are consistent with the C-index.
We propose a statistical approach to tornadoes modeling for predicting and simulating occurrences of tornadoes and accumulated cost distributions over a time interval. This is achieved by modeling the tornadoes intensity, measured with the Fujita scale, as a stochastic process. Since the Fujita scale divides tornadoes …
Develops a framework for identifying mispriced assets through attention factors for statistical arbitrage.
problem Identifying mispriced assets in statistical arbitrage trading.
method Uses conditional latent factors learned from firm characteristic embeddings to identify time-series signals and form a trading strategy.
result Achieves an out-of-sample Sharpe ratio above 4 on the largest U.S. equities over a 24-year period.
Optimal algorithms for non-linear ridge bandits reduce burn-in cost.
problem Non-linear models introduce a burn-in period with fixed cost.
method Two-stage algorithm: find initial action, then treat locally linear.
result Two-stage algorithm is statistically optimal.
Study examines fraud detection methods for credit cards with limited data.
problem Data imbalance in credit card fraud detection.
method Assesses different sampling methods and machine learning algorithms.
result Monte Carlo analysis shows random undersampling outperforms SMOTE in fraud cost reduction.
Study statistical guarantees for DRO with OT and OT-regularized divergences.
problem Enhancing adversarial robustness in machine learning models.
method Derive concentration inequalities for supervised learning via DRO-based adversarial training.
result First to cover soft-constraint costs and reweighting mechanisms in adversarial training.
New auction design uses statistical learning to reduce costs and improve fairness.
problem Designing efficient multi-item auctions with reduced implementation costs and fairness.
method Nonparametric density estimation for credible intervals, two new strategies.
result Strategies consistently outperform alternative methods in revenue maximization and cost reduction.
Flexible approach for normal approximations in geometric and topological statistics.
problem Normal approximation for complex statistics not expressible as sums of score functions.
method Flexible add-one cost operator combined with strong stabilization theory.
result Established normal approximation results for geometric and topological statistics.
Efficient method for training deep learning models with human validation and statistical analysis.
problem Challenges in labeling medical images for deep learning, including time and cost.
method Four-step method using automated data and human visual checks for iterative refinement and statistical validation.
result Initial model accuracy improved from 92% to 98% with statistical validation.
Machine learning predicts Bitcoin returns but trading performance drops with costs.
problem Trading Bitcoin predictions with transaction costs.
method XGBoost, LSTM, iTransformer models evaluated in walk-forward protocol; cost-aware execution filter implemented.
result Cost-aware execution filter restores profitability; XGBoost strategy outperforms.
This article presents results from the first statistically significant study of cost escalation in transportation infrastructure projects. Based on a sample of 258 transportation infrastructure projects worth US$90 billion and representing different project types, geographical regions, and historical periods, it is fou…
We consider the Brownian market model and the problem of expected utility maximization of terminal wealth. We, specifically, examine the problem of maximizing the utility of terminal wealth under the presence of transaction costs of a fund/agent investing in futures markets. We offer some preliminary remarks about stat…
The graphics processing unit (GPU) has emerged as a powerful and cost effective processor for general performance computing. GPUs are capable of an order of magnitude more floating-point operations per second as compared to modern central processing units (CPUs), and thus provide a great deal of promise for computation…
The paper explores the limits of tight PAC-Bayes bounds for cheap models in robust statistics.
problem The challenge of obtaining meaningful bounds on the error of learning algorithms without prior assumptions.
method Investigates tight PAC-Bayes bounds for robust models with minimal cost.
result Demonstrates the limits of obtaining tight PAC-Bayes bounds for cheap models.
Study recovers investor preferences from portfolio data using synthetic data and robust optimization.
problem Recovering latent investor preferences from observed portfolio allocations under uncertainty.
method Inverse portfolio optimization framework integrating robust optimization and regret-based inference.
result Accurate recovery of transaction cost parameters and partial identifiability of ESG penalties under preference misspecification and market shocks.
SCaLE tackles dynamic regret in noisy bandit feedback with switching costs.
problem Unbounded metric movement costs in bandit online convex optimization.
method SCaLE algorithm for high-dimensional dynamic quadratic hitting costs and ℓ2-norm switching costs, with spectral regret analysis. result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.
Algorithm finds function contours using multiple approximations.
problem Locating contours of expensive-to-evaluate functions.
method Uses multiple biased and noisy approximations to locate contours efficiently by maximizing entropy reduction.
result Maximizes reduction of contour entropy per unit cost.
Sparsity helps reduce diffusion model costs.
problem High computational costs in diffusion models.
method Introduced sparsity concept to reduce input dimensionality.
result Sparsity reduces computational complexity to intrinsic data dimension.
New algorithm reduces privacy cost of LDP to central privacy model.
problem Collecting sensitive statistics from multiple users over time.
method Privacy amplification technique using permutation-invariant algorithms.
result Privacy cost of LDP can be much lower in central model.
The paper explores cost-aware spectrum access strategies in cognitive radio systems.
problem Optimizing spectrum usage in cognitive radio systems with uncertain channel states and costs.
method Discrete time model with sensing and transmission phases, considering random costs and rewards.
result The optimal policy for spectrum access has a recursive double threshold structure, and online algorithms achieve near-optimal performance.
Statistical test evaluates if personalizing interventions is cost-effective.
problem Balancing the benefits of personalizing interventions with their potential costs.
method Developed a statistical hypothesis test to assess the performance of personalized interventions.
result The test shows that personalized interventions can outperform standard approaches under certain conditions.
This article presents results from the first statistically significant study of causes of cost escalation in transport infrastructure projects. The study is based on a sample of 258 rail, bridge, tunnel and road projects worth US$90 billion. The focus is on the dependence of cost escalation on (1) length of project imp…
Framework learns to optimize tensor programs for various hardware.
problem Manual optimization of tensor operators for deep learning limits applicability and increases engineering costs.
method Learning-based statistical cost models guide tensor operator implementations over billions of variants.
result Framework delivers performance competitive with hand-tuned libraries across multiple hardware targets.
Develops unbiased estimation method using underdamped Langevin dynamics.
problem Estimating expectations of non-negative Lebesgue density probability measures.
method Underdamped Langevin dynamics, time-discretized versions, doubly randomized estimation.
result Proves finite variance and expected/finite cost of the proposed estimator.
This paper explores how entropic regularization improves Wasserstein estimators' performance.
problem Improving the approximation and estimation properties of Wasserstein estimators.
method Entropic regularization of optimal transport costs to smooth Wasserstein estimators.
result Entropic regularization can achieve comparable statistical performance to un-regularized estimators at lower computational cost.
Super learner with Huber loss improves cost prediction and causal effect estimation in healthcare expenditure data.
problem Challenges in modeling healthcare expenditure distributions with standard super learning methods.
method Proposes a super learner using Huber loss, a robust loss function that down-weights outliers.
result Demonstrates appreciable finite-sample gains in cost prediction and causal effect estimation.
Paper introduces a new cost function to improve deep learning model generalization.
problem Overfitting and poor extrapolation of deep learning models.
method Introduces a 'whitening' cost function based on the Ljung-Box statistic.
result Significant improvement in generalization for RNNs and image autoencoders.
A new algorithm detects changes in data with constant cost per iteration.
problem Detecting changes in data with low computational cost.
method Adapting pruning and maximisation techniques from Gaussian data to exponential family models.
result The algorithm can detect changes in a wide range of models with a constant per-iteration cost.
The paper develops a method to learn robust decision policies from observational data, reducing high-cost outcomes.
problem Learning safe decision policies from observational data with high-risk outcomes.
method Develops a method to learn policies that reduce high-cost outcomes, valid under finite samples and uneven feature overlap.
result Validates the method with real and synthetic data, providing statistical bounds on decision costs.
Paper proposes a method to prune neural networks, reducing storage and computation costs.
problem Reduction of storage and computational costs for deep neural networks.
method Statistical analysis of component significance using F-statistic-based screening technique.
result Pruned models are highly competitive with state-of-the-art approaches.
Because of the prominent position of urban rail in reducing urban transport-related problems, such as congestion and air pollution, insights into the costs of possible new urban rail projects is very relevant for those involved with cost estimations, policy makers, cost-benefit analysts, and other target groups. Knowle…
Improved statistical computation through efficient matrix sampling.
problem Reducing computational cost in large-scale statistical methods.
method Accumulative sub-sampling method to improve statistical efficiency.
result Effective matrix size control improves computational efficiency.
New framework reduces strategic manipulation cost for minority groups in fair classification.
problem Strategic manipulation disparities in fair classification.
method Constrained optimization framework that constructs classifiers to reduce strategic manipulation cost for minority groups.
result Empirically, the approach reduces strategic manipulation cost for minority groups over multiple real-world datasets.
We propose an optimum mechanism for providing monetary incentives to the data sources of a statistical estimator such as linear regression, so that high quality data is provided at low cost, in the sense that the sum of payments and estimation error is minimized. The mechanism applies to a broad range of estimators, in…
A new method reduces the cost of solving large-scale linear models.
problem Solving large-scale linear statistical models efficiently.
method Sequential Preconditioned Conjugate Gradient Method (SPCG).
result SPCG achieves OLS prediction accuracy with fewer iterations and less time.
New framework improves cost-benefit analysis of policies.
problem Limitations of MVPF in welfare analysis.
method Developed an axiomatic framework to create RPV.
result RPV provides better equity-efficiency trade-off quantification.
Cost-aware cascading bandits model for optimizing rewards minus costs.
problem Optimizing rewards minus costs in sequential item examination.
method Proposes a cost-aware cascading bandits model with UCR-T1 policy for offline setting and CC-UCB algorithm for online setting.
result The CC-UCB algorithm achieves cumulative regret scaling in O(log T ) and matches lower bound.
In the field of optimal transport theory, an optimal map is known to be a gradient map of a potential function satisfying cost-convexity. In this paper, the Jacobian determinant of a gradient map is shown to be log-concave with respect to a convex combination of the potential functions when the underlying manifold is t…
A new learning framework reduces PV-Battery system costs by 3.6%.
problem Optimizing PV-Battery systems for cost savings with accurate forecasts.
method Decision-focused learning framework integrating optimization and prediction.
result Decision-focused method reduces average electricity costs by 3.6%.
This paper analyzes the trade-off between accuracy and communication in personalized federated learning.
problem The accuracy-communication trade-off in personalized federated learning.
method The paper provides a quantitative characterization of the personalization degree on the trade-off, establishing minimax optimality.
result The paper offers theoretical insights for choosing the personalization degree and validates the results on synthetic and real-world datasets.