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

90180269359 · Jun 202019922001200920172026
48 results for add-one cost operator

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.

Proposes a new framework for invariant quadratic P&L predictions in option books.

problem Inconsistent second-order P&L predictions across different factor parameterizations.
method Local, model-agnostic framework using covariant Hessian defined by an affine connection.
result Coordinate-invariant quadratic P&L predictions that match desk targets.

We construct a class of compact ancient solutions to the mean curvature flow in Euclidean space with high codimension. In particular, we construct higher codimensional ancient curve shortening flows. Moreover, we characterize the asymptotic behavior of these solutions. Add on remark: the construction in this paper has …

2019-08-07abs ↗pdf ↗

A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a χ2χ^2 test and a regularization. After a relatively s…

2014-10-17abs ↗pdf ↗

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…

2011-12-03abs ↗pdf ↗

GIBLy adds geometric priors to 3D segmentation models, improving performance with minimal overhead.

problem Lack of explicit geometric information in 3D semantic segmentation models.
method Introduces GIBLy, a lightweight geometric inductive bias layer that integrates learnable geometric priors into existing 3D segmentation pipelines.
result Consistent performance gains across multiple benchmarks, including up to +11.5% mIoU on TS40K with PTV3.

The grid integration of intermittent Renewable Energy Sources (RES) causes costs for grid operators due to forecast uncertainty and the resulting production schedule mismatches. These so-called profile service costs are marginal cost components and can be understood as an insurance fee against RES production schedule u…

2014-07-27abs ↗pdf ↗

Software frameworks for neural networks play a key role in the development and application of deep learning methods. In this paper, we introduce the Chainer framework, which intends to provide a flexible, intuitive, and high performance means of implementing the full range of deep learning models needed by researchers …

2019-08-01abs ↗pdf ↗

New pricing framework allocates costs of operating reserves and transmission.

problem Allocating costs of operating reserves and transmission efficiently.
method Causation-based framework using contingency-constrained scheduling models.
result More comprehensive and efficient cost-reflective market operations.

Efficiently models Wrong-Way Risk in FVA without full Monte Carlo.

problem Assessing Wrong-Way Risk in Funding Valuation Adjustments (FVA) without extensive simulations.
method Splitting exposure into independent and WWR-driven parts; approximating WWR-driven part using Gaussian stochastic factor.
result An efficient and robust method to include WWR in FVA modelling.

Study on-chain peak shaving to reduce Ethereum transaction costs.

problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.

The effect of leverage on liquidity is a tool for analysing the level of liquidity for a given production process. It measures the sensitivity of the level of liquidity that results from changes in the volume of production and unit operating margin. A commercial activity is liquid at the moment when all costs are cover…

2010-04-05abs ↗pdf ↗

Developed a cost and revenue model for HEMS to estimate breakeven transport volumes under different reimbursement and labor cost assumptions.

problem Estimating breakeven transport volumes for HEMS under varying reimbursement and labor cost assumptions.
method Developed a two-part model: cost framework and actuarial revenue model using healthcare encounter data and payer reimbursement rates.
result Estimated breakeven transport volumes under different reimbursement and labor cost assumptions.

Study optimal control of diffusion processes with infimum or supremum costs.

problem Optimizing control of a diffusion process with costs dependent on its infimum or supremum.
method Introduced novel integral operators to solve two-dimensional singular control problems.
result Explicit solutions for optimal dividend problem with time-dependent preferences.

Extends expected value framework for cost-sensitive causal decision-making.

problem Optimizing operational decision-making with cost-sensitive causal classification.
method Introduces a cost-sensitive decision boundary based on estimated individual treatment effects, positive outcome probability, and cost parameters.
result Effective in maximizing expected causal profit, outperforming cost-insensitive ranking approach.

Develops algorithms to optimize machine replacement schedules using operational data.

problem Optimizing machine replacement intervals when the lifetime distribution is unknown.
method Formulates as a stochastic multi-armed bandit problem and proposes Hoeffding- and Bernstein-based algorithms.
result Achieves optimal or near-optimal replacement intervals with minimal regret.

New algorithm radVI improves variational inference by optimizing radial profiles.

problem Gaussian approximations often fail to capture the radial profile of complex distributions.
method Optimizes over radial profiles in variational inference, providing theoretical guarantees.
result Theoretical convergence guarantees for radVI, improving over existing VI methods.

Convolutional Neural Networks (CNNs) have become indispensable for solving machine learning tasks in speech recognition, computer vision, and other areas that involve high-dimensional data. A CNN filters the input feature using a network containing spatial convolution operators with compactly supported stencils. In pra…

2019-10-29abs ↗pdf ↗

Convolutional Neural Networks (CNNs) filter the input data using spatial convolution operators with compact stencils. Commonly, the convolution operators couple features from all channels, which leads to immense computational cost in the training of and prediction with CNNs. To improve the efficiency of CNNs, we introd…

2019-04-15abs ↗pdf ↗

Neural Architecture Search (NAS) is an emerging topic in machine learning and computer vision. The fundamental ideology of NAS is using an automatic mechanism to replace manual designs for exploring powerful network architectures. One of the key factors of NAS is to scale-up the search space, e.g., increasing the numbe…

2019-12-31abs ↗pdf ↗

New method speeds up Bayesian inverse problem solving with neural operators.

problem Solving infinite-dimensional Bayesian inverse problems with high computational cost.
method Delayed-acceptance geometric MCMC driven by derivative-informed neural operator surrogates.
result Significant speedup in generating posterior samples (3-9 times faster).

A new method estimates generative model mappings using kernel transfer operators, reducing costs and improving performance.

problem Efficiently estimating mappings between known and unknown distributions in generative models.
method Adapting kernel transfer operators to estimate mappings, reducing computational costs.
result Significant runtime savings and good empirical performance compared to existing methods.

A system for federated learning with private data, adding discrete Gaussian noise and secure aggregation.

problem Training models on private data distributed across devices while ensuring privacy.
method Discretizes data, adds discrete Gaussian noise, and uses secure aggregation to protect privacy.
result Matches the accuracy of central differential privacy with less than 16 bits of precision per value.

Decision-calibrated prediction sets improve power system operations by reducing unnecessary costs.

problem Balancing operating costs and reliability in power systems with renewable uncertainty.
method Learn conditional prediction sets as sub-level sets of norm-based score functions, calibrate uncertainty sets based on reliability of downstream decisions.
result Decision-calibrated sets lead to more efficient operations with smaller uncertainty sets and lower costs compared to standard coverage-based calibration.

Adaptive operator learning reduces costs in Bayesian inverse problems.

problem Reducing computational costs in Bayesian inverse problems governed by PDEs.
method Adaptive operator learning framework that gradually reduces modeling error.
result The approach significantly reduces computational costs while maintaining inversion accuracy.

Negative step sizes improve second-order methods for neural networks.

problem Second-order methods discard negative curvature, limiting their effectiveness.
method Introduce negative step sizes in second-order methods combined with Wolfe line search.
result Negative step sizes lead to global convergence and improved performance.

This work proposes searching for optimal operation distribution in neural architecture search.

problem Finding optimal neural architecture with specific operations and connections.
method Search for the optimal operation distribution, providing a stochastic and approximate solution.
result Operation distribution holds enough discriminating power to reliably identify a solution and is easier to optimise than traditional encodings.

In this study we model the warranty claims process and evaluate the warranty servicing costs under non-renewing and renewing free repair warranties. We assume that the repair time for rectifying the claims is non-zero and the repair cost is a function of the length of the repair time. To accommodate the ageing of the p…

2018-03-02abs ↗pdf ↗

The paper explores how mining costs, rewards, and blockchain security are interconnected.

problem Understanding the interdependencies between mining costs, mining rewards, and blockchain security.
method Theoretical derivation and empirical analysis using daily crypto market data and autoregressive distributed lag approach.
result Cryptocurrency price and mining rewards are intrinsically linked to blockchain security outcomes.

The paper introduces a new metric to quantify uncertainty's impact on multiple objectives.

problem Quantifying the impact of uncertainty on multiple objectives in complex systems.
method Proposes the mean multi-objective cost of uncertainty (multi-objective MOCU) to quantify uncertainty.
result Demonstrates the effectiveness of the multi-objective MOCU in real-world applications.

We introduce a learning-based framework to optimize tensor programs for deep learning workloads. Efficient implementations of tensor operators, such as matrix multiplication and high dimensional convolution, are key enablers of effective deep learning systems. However, existing systems rely on manually optimized librar…

2018-05-21abs ↗pdf ↗

Latent-IMH improves Bayesian inference for expensive operators.

problem Efficient sampling from posterior distributions in inverse problems with computationally expensive operators.
method Metropolis-Hastings independence sampler using approximate and exact operators.
result Latent-IMH outperforms existing methods in computational efficiency.

Optimal multiscale learning of linear operators

problem Statistical and computational limits of learning bounded linear operators between Sobolev spaces
method Reformulate as an infinite-dimensional matrix regression problem with heterogeneous multiscale structure
result Establish minimax rates and construct a finite-resolution blockwise least-squares estimator attaining these rates

Paper proposes a deep reinforcement learning model for forex trading that considers transaction costs.

problem Trading in forex markets with high transaction costs and non-stationary data.
method Deep reinforcement learning model considering transaction costs and online learning.
result Maximizes profit while keeping transaction costs low in non-stationary markets.