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

Trend · papers per month

80160239319 · Jun 202019922001200920172026
48 results for global costs

FedFMC improves federated learning on non-iid data without sharing data or increasing communication costs.

problem Efficiently updating a global model on non-iid data in federated learning.
method FedFMC dynamically forks devices into different global models, merges and consolidates them.
result FedFMC substantially improves upon earlier approaches to non-iid data in federated learning.

Study optimal transport on globally hyperbolic spacetimes, focusing on weak Kantorovich potentials' regularity.

problem Investigate regularity of weak Kantorovich potentials on globally hyperbolic spacetimes.
method Apply insights from Riemannian and Lorentzian cases to study ππ-solutions.
result Conclude existence, uniqueness, and structure of optimal transport maps.

A novel algorithm reduces communication costs in federated best arm identification.

problem Identifying the best arm in a federated multi-armed bandit setup with minimal communication cost.
method Proposes a novel algorithm called FedElim that communicates only in exponential time steps.
result Demonstrates that communication is almost cost-free in FedElim, with a total cost at most 3 times the maximum under its variant.

Policy gradient converges to globally optimal policy in nearly linear-quadratic systems.

problem Finding optimal policies in nonlinear control systems with partial information.
method Policy gradient algorithm designed for nearly linear-quadratic regulators with small Lipschitz nonlinear components.
result Policy gradient algorithm converges to globally optimal policy with linear rate.

Paper presents an efficient algorithm for linear MDP with low switching cost.

problem Large state space reinforcement learning problems with low switching cost.
method First algorithm for linear MDP with low switching cost, achieving near-optimal regret and switching cost.
result Regret bound of $\widetilde{O}\left(\sqrt{d^3H^4K} ight)$ and near-optimal switching cost of $O\left(d H\log K ight)$.

Less frequent retraining improves forecast accuracy in retail demand forecasting.

problem Balancing forecast accuracy and computational efficiency in global models.
method Analysis of ten machine learning and deep learning models across two large retail datasets with various retraining scenarios.
result Less frequent retraining strategies maintain forecast accuracy while reducing computational costs.

The paper constructs minimizers for deep learning networks and analyzes their geometric structure.

problem Underparametrized deep learning networks and their minimizers.
method Direct construction of minimizers without gradient descent, considering specific settings.
result Explicit family of minimizers for the global minimum and a set of degenerate local minima.

Improved portfolio optimization method yields better risk-adjusted returns.

problem Optimizing global minimum variance portfolios with reduced risk.
method k-fold boosted kk-BAHC covariance cleaning procedure for correlation matrices.
result Our method outperforms other filtering methods in Sharpe ratios, despite higher turnover.

In the early phases of the product life cycle, the costs controls became a major decision tool in the competitiveness of the companies due to the world competition. After defining the problems related to this control difficulties, we will present an approach using a concept of cost entity related to the design and real…

2010-11-26abs ↗pdf ↗

This paper presents efficient sampling methods for Gaussian processes.

problem High cost of global sensitivity analysis and optimization due to limited high-quality observations.
method Two sampling methods: random Fourier features and pathwise conditioning.
result Efficient generation of posterior samples from Gaussian processes at reduced computational cost.

This paper presents a stochastic model for discrete-time trading in financial markets where trading costs are given by convex cost functions and portfolios are constrained by convex sets. The model does not assume the existence of a cash account/numeraire. In addition to classical frictionless markets and markets with …

2008-07-16abs ↗pdf ↗

Study uses RL to optimize global equity portfolios, finds mixed results.

problem Optimizing dynamic portfolio weights across diverse global markets.
method Deep reinforcement learning with Soft Actor-Critic, incorporating various constraints and reward formulations.
result RL strategies achieve competitive performance, but no strategy consistently outperforms Buy and Hold.

Bitcoin mining costs remain stable despite increased activity.

problem Stability of Bitcoin mining costs despite rising energy consumption.
method Estimation of global energy cost over a decade, considering changing oil costs and technological improvements.
result The cost of Bitcoin mining has remained relatively stable since 2010, relative to the volume of transactions.

Study on distributed nonparametric function estimation with optimal rate and cost of adaptation.

problem Optimal rate of convergence and cost of adaptation in distributed nonparametric function estimation.
method Distributed minimax estimation and adaptive estimation under communication constraints for Gaussian sequence model and white noise model.
result Established minimax rate of convergence and exact communication cost for adaptation.

Modeling climate change costs with stochastic interest rates shows inequality, but funding abatement can reduce this.

problem Evaluating the costs and benefits of climate change mitigation with uncertain discount rates.
method Amended DICE model with stochastic interest rates and funding abatement costs.
result Introducing funding abatement can reduce intergenerational inequality in climate change costs.

A new TwinGP framework for efficient large-scale GP modeling.

problem Efficiently modeling large-scale Gaussian processes with computational constraints.
method Combines global and local approximations using a subset-of-data approach.
result TwinGP framework performs on par or better than state-of-the-art methods at a fraction of the computational cost.

LaMBO optimizes modular systems with switching costs, achieving better results than existing methods.

problem Optimizing systems with costly variable updates in a sequence of modules.
method Lazy Modular Bayesian Optimization (LaMBO) that minimizes switching costs.
result LaMBO achieves vanishing regret and improves over existing cost-aware Bayesian optimization algorithms.

Federated learning is an emerging technique used to prevent the leakage of private information. Unlike centralized learning that needs to collect data from users and store them collectively on a cloud server, federated learning makes it possible to learn a global model while the data are distributed on the users' devic…

2018-12-18abs ↗pdf ↗

BOKE optimizes expensive functions with reduced computational costs.

problem High computational cost of Gaussian process-based Bayesian optimization.
method Kernel regression and density-based exploration integrated into confidence bounds.
result BOKE achieves global convergence and superior computational efficiency.

Study creates a global living index to assess quality of life.

problem Long-term impacts of global economic changes on living conditions.
method Machine learning framework combining socio-economic factors.
result Developed a practical tool for policymakers to identify areas needing improvement.

The paper proves convergence to global optima for a class of distributed algorithms for nonconvex optimization in network-based multi-agent settings. Agents are permitted to communicate over a time-varying undirected graph. Each agent is assumed to possess a local objective function (assumed to be smooth, but possibly …

2019-03-18abs ↗pdf ↗

Model liquidity premia using a risk-sharing economy with quadratic costs.

problem Understanding the cross-section of liquidity premia earned by assets with different trading costs.
method Developed a risk-sharing economy model with quadratic transaction costs, leading to matrix-valued Riccati equations for equilibrium.
result Calibrated model to time series data, revealing liquidity premia across assets with varying trading costs.

For portfolio choice problems with proportional transaction costs, we discuss whether or not there exists a "shadow price", i.e., a least favorable frictionless market extension leading to the same optimal strategy and utility. By means of an explicit counter-example, we show that shadow prices may fail to exist even i…

2012-05-21abs ↗pdf ↗

New findings show different cost functions yield equivalent curvature bounds.

problem Establishing equivalence of curvature bounds under various transport costs.
method Needle decomposition and localization technique for optimal transport.
result All CDp(K,N)\mathrm{CD}_{p}(K,N) conditions are equivalent for p>1p>1.

Effective dimensionality reduction improves accuracy and reduces costs in estimating option Greeks.

problem Estimating Greeks for barrier and arithmetic average Asian options.
method Global sensitivity analysis, Chebyshev interpolation, conditional pathwise method, randomized Quasi Monte Carlo, Brownian bridge discretization, importance sampling.
result Reduced effective dimensionality enhances convergence rate and accuracy of randomized Quasi Monte Carlo integration.

This paper analyzes air pollution trends in Rwanda using low-cost sensors and machine learning.

problem Lack of reliable air pollution data in Rwanda due to high costs of equipment.
method Analysis of existing data and development of forecasting models using low-cost sensors and machine learning.
result Proposes forecasting models for air pollution data collected by low-cost sensors.

Gradient descent with preconditioning finds global optima in overparameterized nonconvex factorization.

problem Finding global optima in nonconvex Burer-Monteiro factorization.
method Preconditioned gradient descent for overparameterized nonconvex function minimization.
result Gradient descent with preconditioning achieves linear convergence in the overparameterized case.