Using a methodology similar to that used the in the worldwide research, the cost performance of Dutch large-scale transport infrastructure projects is determined. In the Netherlands, cost overruns are as common as cost underruns but because cost overruns are larger than cost underruns projects on average have a cost ov…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Construction Cost”
Study develops a cost model for field canals improvement projects in Egypt.
problem Accurately predict the preliminary costs of field canals improvement projects.
method Developed a parametric cost model using machine learning methods.
result Identified key cost drivers and developed a model for FCIPs.
The paper constructs upper bounds for cost minimization in shallow neural networks.
problem Cost minimization in underparametrized shallow ReLU networks.
method Explicit construction of upper bounds based on the geometric structure of classification data.
result An upper bound on the minimum of the cost function of order , with exact degenerate local minimum in the special case .
This paper examines three independent explanatory variables and their relation with cost overrun in order to decide whether this is different for Dutch infrastructure projects compared to worldwide findings. The three independent variables are project type (road, rail, and fixed link projects), project size (measured i…
Impact of aleatoric, stochastic and epistemic uncertainties on project cost contingency reservesstat.AP
Paper proposes a method to estimate project cost contingency reserves considering various types of uncertainty.
problem Inaccurate estimation of project cost contingency reserves due to ignoring different types of uncertainty.
method Quantitative determination of project cost contingency reserves using Monte Carlo Simulation considering aleatoric, stochastic, and epistemic uncertainties.
result The proposed method provides more accurate contingency reserves that align with actual project risks.
Constructive no-arbitrage criterion under transaction costs in the case of finite discrete timemath.PR
We obtain a constructive criterion for robust no-arbitrage in discrete-time market models with transaction costs. This criterion is expressed in terms of the supports of the regular conditional upper distributions of the solvency cones. We also consider the model with a bank account. A method for construction of arbitr…
Explicit Recursive Construction of Super-Replication Prices under Proportional Transaction Costsq-fin.MF
New method calculates super-hedging prices with transaction costs.
problem Super-hedging European contingent claims under proportional transaction costs.
method Explicit recursive scheme based on convex duality and Legendre-Fenchel transform.
result Computes super-hedging price and optimal strategy without martingale arguments.
Constructs independent bases for cubic curve families using Hessian structures.
problem Finding independent bases for cubic curve families.
method Uses a Hessian structure to define a cost function for constructing bases.
result Constructs valuatively independent bases for .
We study the arbitrage opportunities in the presence of transaction costs in a sequence of binary markets approximating the fractional Black-Scholes model. This approximating sequence was constructed by Sottinen and named fractional binary markets. Since, in the frictionless case, these markets admit arbitrage, we aim …
We theoretically and empirically study portfolio optimization under transaction costs and establish a link between turnover penalization and covariance shrinkage with the penalization governed by transaction costs. We show how the ex ante incorporation of transaction costs shifts optimal portfolios towards regularized …
Estimates optimal transport maps with known cost functions.
problem Ensuring optimal transport maps correspond to real-world usefulness.
method Differentiable neural ground costs with known Monge map forms.
result General approach for incorporating prior information.
The paper optimizes portfolios with transaction costs in a large asset universe.
problem Optimizing portfolios with transaction costs in a large asset universe.
method Mean-variance optimization with nonconvex penalty for proportional and quadratic transaction costs.
result The proposed models show satisfactory performance and highlight the importance of transaction costs.
Optimizes portfolios with costs, showing existence of optimal strategies.
problem Risk-sensitive portfolio optimization with transaction costs.
method Log-return i.i.d. framework, Bellman equation analysis.
result Existence of optimal strategies for risk-averse and risk-seeking cases.
Model shows how Ethereum can capture MEV from block construction, but centralization remains a concern.
problem Ethereum's ability to capture MEV from block construction.
method Economic model of Execution Tickets to study MEV extraction.
result MEV capture decreases with risk aversion and capital costs, and can be low with heterogeneous buyers.
In the present work, the optimal portfolio minimizing the investment risk with cost is discussed analytically, where this objective function is constructed in terms of two negative aspects of investment, the risk and cost. We note the mathematical similarity between the Hamiltonian in the mean-variance model and the Ha…
Proposes an angle-based framework for multicategory cost-sensitive classification.
problem Cost-sensitive multicategory classification challenges.
method Angle-based cost-sensitive classification framework without sum-to-zero constraint.
result Proposed boosting algorithms yield competitive classification performances.
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.
Study predicts high-cost patients using insurance claims data.
problem Accurately identifying high-cost patients to manage costs.
method Applied machine learning to health insurance claims data.
result Developed a high-performance algorithm with 91.2% AUC.
We develop a general Minmax procedure in Euclidian spaces for constructing Willmore surfaces of non zero indices. We implement this procedure to the Willmore Minmax Sphere Eversion in the 3 dimensional euclidian space. We compute the cost of the Sphere eversion in terms of Willmore energies of Willmore Spheres in ${\R}…
Dynamic hedging of an European option under a general local volatility model with small linear transaction costs is studied. A continuous control version of Leland's strategy that asymptotically replicates the payoff is constructed. An associated central limit theorem of hedging error is proved. The asymptotic error va…
Optimizes renewable energy mix to meet carbon-free targets at lowest cost.
problem Minimizing annual procurement costs while achieving specified carbon-free hourly performance.
method Probabilistic framework with simulation scenarios and probability constraints. Fixed set of renewable generators and load customer.
result Demonstrated that certain renewable energy portfolios can meet carbon-free targets at lower costs compared to others.
This work adapts RDT for mental program construction, showing benefits and costs.
problem Applying RDT to mental programs with trade-offs between description length, error, and computational costs.
method Proposed a three-way trade-off and used simulations and partial information decomposition.
result Constructing a shared program library provides global benefits but is sensitive to curricula.
We consider the problem of optimizing the expected logarithmic utility of the value of a portfolio in a binomial model with proportional transaction costs with a long time horizon. By duality methods, we can find expressions for the boundaries of the no-trade-region and the asymptotic optimal growth rate, which can be …
Constructs supermartingale couplings with full marginals constraints.
problem Optimal transport for supermartingale couplings with multiple marginals.
method Markovian iteration of one-period optimal supermartingale couplings.
result Explicit construction of supermartingale processes solving optimal transport problem.
Recently, machine learning algorithms have successfully entered large-scale real-world industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during test time must be budgeted and accounted for. In this paper, we address the challenge of balancing the test-time cost and the classifier …
The pricing, hedging, optimal exercise and optimal cancellation of game or Israeli options are considered in a multi-currency model with proportional transaction costs. Efficient constructions for optimal hedging, cancellation and exercise strategies are presented, together with numerical examples, as well as probabili…
Distributed Nonparametric Function Estimation: Optimal Rate of Convergence and Cost of Adaptationmath.ST
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.
A Cholesky decomposition-based asset selection heuristic for sparse tangent portfolio optimizationq-fin.MF
New heuristic selects fewer assets for efficient portfolios, reducing costs.
problem High transaction costs and fees from including many assets in portfolios.
method Surrogate formulation to select assets, re-optimizes portfolio with fewer assets.
result Effective in constructing portfolios with fewer assets, reducing costs.
Equilibrium found for multi-agent trading with transaction costs.
problem Designing a trading equilibrium for multiple agents with transaction costs.
method Proving the existence of a continuous-time Radner equilibrium with incentives and transaction costs.
result Each agent optimally trades for a specific time interval before stopping, influenced by transaction costs.
Introduces a Cost function to measure Legendrian knot obstructions.
problem Measuring obstructions for Legendrian knot isotopies.
method Introduces a non-negative integer-valued Cost function.
result Cost function induces a metric on topologically isotopic Legendrian knots.
Estimates returns for dollar cost averaging using geometric Brownian motion.
problem Estimating returns for dollar cost averaging investing strategy.
method Uses geometric Brownian motion and log-Normal distribution to construct a lower bound for returns. Computes parameters recursively and in closed form for dollar cost averaging. Compares to lump sum investing for matching wealth distributions.
result Probability of negative returns is less than 2.5% for 40 years of annual dollar cost averaging.
Efficient adjustment sets found for cost-minimized causal estimations.
problem Estimating interventional means with minimum cost in causal graphical models.
method Defined cost-adjustment sets, constructed flow networks, and used maximum flow algorithms.
result Minimum cost optimal adjustment sets exist and can be found efficiently.
The Thermodynamic Costs of Simple Linear Regressioncond-mat.stat-mech
Study on thermodynamic costs of simple linear regression.
problem Understanding thermodynamic costs in machine learning models.
method Approximated thermodynamic lower bounds for exact and stochastic linear regression.
result Derived scaling laws for optimal dataset size based on generalization error.
The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions. To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibl…
We study the problem of online learning in a class of Markov decision processes known as linearly solvable MDPs. In the stationary version of this problem, a learner interacts with its environment by directly controlling the state transitions, attempting to balance a fixed state-dependent cost and a certain smooth cost…
Diversified risk parity strategies outperform equally-weighted portfolios in various asset universes.
problem Finding optimal portfolio allocations that balance risk and reward.
method Integrates various reward-risk measures and generic allocation rules into diversified risk parity.
result Diversified reward-risk parity strategies exhibit higher average returns, Sharpe ratios, and Calmar ratios compared to equally-weighted risk portfolios.
We give an explicit algorithm and source code for extracting expected returns for stocks from expected returns for alphas. Our algorithm altogether bypasses combining alphas with weights into "alpha combos". Simply put, we have developed a new method for trading alphas which does not involve combining them. This yields…
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…
Sector specific multifactor CES elasticity of substitution and the corresponding productivity growths are jointly measured by regressing the growths of factor-wise cost shares against the growths of factor prices. We use linked input-output tables for Japan and the Republic of Korea as the data source for factor price …
We develop coreset techniques for noisy clustering with provable guarantees.
problem Clustering with stochastic noise in datasets.
method Surrogate error metrics and coreset construction algorithm.
result Improved coreset size and better guarantees on true clustering cost.
We construct algorithms for computation of prices and superhedging strategies for game options in general discrete markets both from the seller and the buyer points of view.
New algorithms minimize regret with global costs in online learning.
problem Minimizing regret in online learning with global costs.
method Extended FTRL algorithms for Blackwell's approachability.
result First bounds on regret minimization with explicit dependence in and .
Neural nets optimize dynamic hedging strategies with transaction costs.
problem Optimal hedging strategy in presence of transaction costs and discrete time.
method Convolutional neural network trained to infer optimal hedging frequencies.
result Dynamic multiscale hedging strategy reduces risk and maximizes profit.
Explicit robust hedging strategies for convex or concave payoffs under a continuous semimartingale model with uncertainty and small transaction costs are constructed. In an asymptotic sense, the upper and lower bounds of the cumulative volatility enable us to super-hedge convex and concave payoffs respectively. The ide…
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.
A new method for optimal transport using neural ODEs that preserves marginal constraints.
problem Optimal transport between two continuous distributions with specific cost functions.
method Iterative construction of neural ODEs to minimize transport cost while preserving marginal constraints.
result Monotonic interior approach that decreases transport cost efficiently.
Asymptotic error distribution for approximation of a stochastic integral with respect to continuous semimartingale by Riemann sum with general stochastic partition is studied. Effective discretization schemes of which asymptotic conditional mean-squared error attains a lower bound are constructed. Two applications are …
Study compares optimal vs. naive diversification in crypto markets, finds time-varying moments improve performance.
problem Optimizing portfolio construction in volatile crypto markets.
method Examines time-varying moments and transaction costs, incorporates turnover penalty.
result Time-varying moment estimators outperform conventional estimators in practical portfolio construction.