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.
We reconsider the problem of optimal trading in the presence of linear and quadratic costs, for arbitrary linear costs but in the limit where quadratic costs are small. Using matched asymptotic expansion techniques, we find that the trading speed vanishes inside a band that is narrower than in the absence of quadratic …
Agent optimizes perpetual contract liquidation with transaction costs and risk.
problem Optimizing perpetual contract liquidation with transaction costs and risk.
method Solving stochastic control problem for optimal trading strategy.
result Closed-form expression and approximations for optimal strategy.
Non-linear shrinkage isn't optimal for portfolio optimization, especially when asset dependence is non-stationary.
problem Optimizing portfolios with non-stationary asset dependence structures.
method Derived and compared non-linear shrinkage with an optimal target for covariance matrix estimation.
result Non-linear shrinkage can be significantly improved for portfolio optimization.
New method adds all interactions in non-linear models without high computational cost.
problem Missing interactions in interpretable machine learning models.
method Additive higher-order factorization machines using tensor product splines.
result Scalable model with interactions at low computational cost.
Study non-Gaussian measures' concentration properties in metric spaces.
problem Concentration properties for non-linear Gaussian functionals with non-Gaussian tails.
method Prove generalised Transportation-Cost Inequalities (TCIs) for specific functionals.
result Extended TCIs for rough volatility and Parabolic Anderson Model.
New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.
problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.
We derive asset pricing formula for markets with incomplete information and subjective views.
problem Asset pricing in markets with informational imperfections and subjective investor beliefs.
method Closed-form market equilibrium formula based on Merton's model, non-linear system of equations, conditional posterior distribution.
result Derivation of market reference model for excess returns under random shadow-costs.
This paper proposes a new method to learn integration schemes for complex ODEs.
problem Learning efficient integration schemes for non-linear ODEs and their identification.
method A novel framework to learn integration schemes that minimize an integration-related cost function.
result The proposed learning-based approach provides integration schemes close to analytical solutions.
We introduce the Randomized Dependence Coefficient (RDC), a measure of non-linear dependence between random variables of arbitrary dimension based on the Hirschfeld-Gebelein-Rényi Maximum Correlation Coefficient. RDC is defined in terms of correlation of random non-linear copula projections; it is invariant with respec…
Inference-aware meta-alignment of LLMs reduces computational cost.
problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.
This paper introduces an acceleration structure for hyperbolic embeddings.
problem Efficiently embedding and visualizing high-dimensional data in hyperbolic spaces.
method Building upon a polar quadtree, the paper introduces a new acceleration structure for hyperbolic embeddings.
result The new method computes embeddings in significantly less time compared to existing methods.
Develops algorithms for CCBs with non-linear costs, improving safety and performance.
problem Safety constraints in sequential decision making with non-linear arm costs.
method Innovative algorithms using Inverse Gap Weighting (IGW) and online regression oracle.
result Sub-linear regret bounds for C-SquareCB and first-order regret for C-FastCB.
We consider a model of linear market impact, and address the problem of replicating a contingent claim in this framework. We derive a non-linear Black-Scholes Equation that provides an exact replication strategy. This equation is fully non-linear and singular, but we show that it is well posed, and we prove existence o…
Paper is based on "The cost of illiquidity and its effects on hedging", L. C. G. Rogers and Surbjeet Singh, 2010. We generalize its thesis to constant elasticity model, which own previously used Black-Schoels model as a special case. The Goal of this article is to find optimal hedging strategy of European call/put opti…
Proposes HSIC-Lasso for selective inference in non-linear data.
problem Detecting influential features in non-linear and high-dimensional data.
method Model-free HSIC-Lasso based on truncated Gaussians and polyhedral lemma.
result Tight control of type-I error even for small sample sizes.
With this work we try to analyse the agglomeration process in the Portuguese regions, using the New Economic Geography models. In these models the base idea is that where has increasing returns to scale in the manufactured industry and low transport costs, there is agglomeration. Of referring, as summary conclusion, th…
The research presented in this work is motivated by some recent papers regarding hedging and valuation of financial securities subject to funding costs, collateralization and counterparty credit risk. Our goal is to provide a sound theoretical underpinning for some results presented in these papers by developing a unif…
We develop an arbitrage-free framework for consistent valuation of derivative trades with collateralization, counterparty credit gap risk, and funding costs, following the approach first proposed by Pallavicini and co-authors in 2011. Based on the risk-neutral pricing principle, we derive a general pricing equation whe…
Analyzes valuation of derivative claims with asymmetric funding costs and WWR.
problem Valuing and hedging derivative claims with bilateral cash flows in asymmetric funding and risk environments.
method Characterizes pre-default claim value as solution to a non-linear Cauchy problem, applies stochastic representation under linear funding policy.
result Derivative claim value can be represented as a portfolio of European options and admits an analytical formula involving elementary functions and Gaussian integrals.
Improved RTM uses integer weights to reduce computation and increase interpretability.
problem Lack of interpretability in nonlinear regression models.
method Integer weighted RTM clauses, combined with a novel learning scheme.
result Significantly reduced computation cost with improved accuracy.
New method adds interactions to interpretable models for large-scale data.
problem Limited model complexity and lack of interactions in interpretable models.
method Factorization method to derive scalable higher-order tensor product spline models.
result Incorporates all higher-order interactions of non-linear feature effects without computational penalties.
We provide a pointwise confidence bound for non-linear least-squares with fixed design.
problem Confidence estimation in non-linear ℓ2-regularized least squares. method Pointwise confidence bound for local minimizers, using weighted norm involving inverse-Hessian.
result The proposed confidence bound scales with the test input's similarity to the training data.
Empirical study shows Randomized Signature Methods improve portfolio optimization in financial markets.
problem Drift estimation in non-linear, non-parametric financial markets is challenging.
method Applied Randomized Signature Methods for non-linear, non-parametric drift estimation in multi-variate financial markets.
result Randomized Signature Methods provide features on the same scale and improve portfolio optimization in real-world settings.
DANCE optimizes neural network and accelerator design for faster, more efficient DNN execution.
problem Challenges in optimizing neural network and accelerator design for efficient DNN execution.
method Differentiable approach to co-exploration of accelerator and network architecture design.
result Significantly shorter time to achieve superior accuracy and hardware cost metrics.
This paper concerns the numerical solution of the finite-horizon Optimal Investment problem with transaction costs under Potential Utility. The problem is initially posed in terms of an evolutive HJB equation with gradient constraints. In Finite-Horizon Optimal Investment with Transaction Costs: A Parabolic Double Obst…
This paper studies the optimal investment problem with random endowment in an inventory-based price impact model with competitive market makers. Our goal is to analyze how price impact affects optimal policies, as well as both pricing rules and demand schedules for contingent claims. For exponential market makers prefe…
Two Fisher information matrix estimators are analyzed for neural networks, focusing on their variances and trade-offs.
problem Estimating the Fisher information matrix in neural networks due to its high computational cost.
method Examined two popular diagonal Fisher information matrix estimators and their variances in neural networks for regression and classification.
result The variances of the estimators depend on the non-linearity with respect to different parameter groups and should not be neglected.
It is well-known from the work of Schönbucher (2005) that the marginal laws of a loss process can be matched by a unit increasing time inhomogeneous Markov process, whose deterministic jump intensity is called local intensity. The Stochastic Local Intensity (SLI) models such as the one proposed by Arnsdorf and Halperin…
New framework for analyzing games with multi-dimensional singular controls and non-linear jumps.
problem Analyzing games with multi-dimensional singular controls and non-linear jump impacts.
method Probabilistic framework with novel class of MFGs (MFGs of parametrisations).
result Existence of equilibria and equivalence with MFGs of singular controls.
We solve a complex Bayesian control problem with novel methods.
problem Optimizing control of a hidden signal's influence on noisy observations.
method Measure-valued HJB perspective, viscosity theory, approximation arguments.
result Equivalence to HJB equation and continuous viscosity solution.
This paper studies the continuous time mean-variance portfolio selection problem with one kind of non-linear wealth dynamics. To deal the expectation constraint, an auxiliary stochastic control problem is firstly solved by two new generalized stochastic Riccati equations from which a candidate portfolio in feedback for…
Study contextual bandits with stage-wise constraints, proving regret bounds and extending results.
problem Contextual bandits with stage-wise constraints in high probability and expectation settings.
method Upper-confidence bound algorithms for linear and non-linear reward/cost functions, extending to multiple constraints.
result Regret bounds for various settings, including non-linear reward/cost functions.
Optimizes bidding in hourly and quarter-hourly electricity markets to reduce price impact.
problem Maximizing profit in two consecutive electricity markets with market impact and transaction costs.
method Examined multiple price scenarios, estimated market impact, used trading strategies, provided theoretical results.
result Minimizing price impact is more profitable than maximizing arbitrage in the German EPEX market.
New algorithm achieves nearly optimal regret with one-pass updates for GLB problems.
problem Generalized linear bandits with non-linear reward distributions.
method Jointly efficient algorithm using OMD estimator with one-pass updates.
result Nearly optimal regret bound with O(1) time and space complexities per round. Proposes a new model to measure trade impact and information content in fluctuating markets.
problem Measuring price impact and information content of trades in a time-varying market setting.
method Non-linear observation-driven model for dynamically estimating market impact and information content.
result Market impact shows intraday patterns with large fluctuations, some of which are exogenous.
New GP model tackles physics constraints efficiently.
problem Lack of efficient, physics-informed models for complex systems.
method Physics-informed variational state-space Gaussian process.
result Efficient spatio-temporal modeling with improved performance.
Paper analyzes dataset distillation for efficient encoding of task-relevant information.
problem Efficiently encoding task-relevant information from gradient-based learning of non-linear tasks.
method Theoretical analysis of dataset distillation applied to two-layer neural networks with gradient-based training.
result Low-dimensional structure of the problem is efficiently encoded into distilled data, reproducing a model with high generalization ability.
Surrogate models improve tidal model calibration efficiency.
problem Efficiently calibrate complex tidal models for climate change scenarios.
method Proposes two surrogate-based methods to replace complex models: PODEn3DVAR and POD-PCE-3DVAR.
result Both methods show superior convergence and robustness to noise compared to classical 3DVAR.
In illiquid markets, option traders may have an incentive to increase their portfolio value by using their impact on the dynamics of the underlying. We provide a mathematical framework within which to value derivatives under market impact in a multi-player framework by introducing strategic interactions into the Almgre…
The importance of collateralization through the change of funding cost is now well recognized among practitioners. In this article, we have extended the previous studies of collateralized derivative pricing to more generic situation, that is asymmetric and imperfect collateralization with the associated counter party c…
A risk-averse agent hedges her exposure to a non-tradable risk factor U using a correlated traded asset S and accounts for the impact of her trades on both factors. The effect of the agent's trades on U is referred to as cross-impact. By solving the agent's stochastic control problem, we obtain a closed-form expr…
A number of approaches to solving the well-known transfer pricing problem are known. However, few models satisfactorily resolve the core problem of allowing both the source and receiving divisions to earn a profit on transfers during a period in such a way that sub-optimal output levels are avoided. In 1969, Samuel pro…
We present a deep learning framework for quantifying and propagating uncertainty in systems governed by non-linear differential equations using physics-informed neural networks. Specifically, we employ latent variable models to construct probabilistic representations for the system states, and put forth an adversarial …
Combines dynamic programming and neural networks for optimal portfolio execution in regime-switching markets.
problem Optimal execution in a market with multiple regimes and non-linear impact costs.
method Four-step numerical framework: approximated orthogonal portfolios, dynamic program for schedule, neural network optimization.
result Neural network optimized strategy outperforms traditional methods in both CRRA and mean-variance objectives.
This essay quantifies convexities in incomplete markets using entropy, adjusting prices for risk and incompleteness.
problem Quantifying convexities in incomplete markets and adjusting prices for risk and incompleteness.
method Using entropy, the essay quantifies convexities and adjusts prices for risk and incompleteness in incomplete markets.
result A new price principle derived from a log-martingale condition is introduced, matching risk aversion and adjusting for market incompleteness and default risk.
This paper uses Reinforcement Learning to select features from a large dataset.
problem Selecting the best features to minimize variance and bias in machine learning models.
method Formulated the feature selection problem as a Markov Decision Process (MDP) and used Temporal Difference (TD) algorithm.
result The approach using Reinforcement Learning outperformed other methods in selecting features.
We introduce a new, efficient, principled and backpropagation-compatible algorithm for learning a probability distribution on the weights of a neural network, called Bayes by Backprop. It regularises the weights by minimising a compression cost, known as the variational free energy or the expected lower bound on the ma…