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

Trend · papers per month

4998147196 · Jun 202019922001200920172026
48 results for Monotonic Transformation

The paper proves a transformation theorem under a monotone property of almost Euclidean factors of geodesic balls.

problem The non-increasing property of numbers of almost Euclidean factors of geodesic balls.
method Proves a transformation theorem under a non-decreasing property compared to the non-increasing property.
result Shows that for a manifold with nonnegative Ricci curvature, if its universal cover is polar at infinity and the number of almost Euclidean factors is monotone, then its fundamental group is finitely generated and virtually abelian.

Efficient algorithms find optimal monotone transforms for calibration under strictly convex losses.

problem Calibrating estimations to improve performance with monotone transforms.
method Proposed linear-time and space algorithm for finding optimal monotone transforms for specific loss functions. Also proposed an anytime algorithm with linear space and pseudo-linearithmic time complexity.
result Optimal monotone transforms are unique and can be found efficiently for various strictly convex loss functions.

Monotonic neural networks have recently been proposed as a way to define invertible transformations. These transformations can be combined into powerful autoregressive flows that have been shown to be universal approximators of continuous probability distributions. Architectures that ensure monotonicity typically enfor…

2019-08-14abs ↗pdf ↗

Exploiting low-rank structure of the user-item rating matrix has been the crux of many recommendation engines. However, existing recommendation engines force raters with heterogeneous behavior profiles to map their intrinsic rating scales to a common rating scale (e.g. 1-5). This non-linear transformation of the rating…

2018-10-31abs ↗pdf ↗

New method calibrates neural network predictions for better reliability.

problem Improper probability estimates from deep networks leading to unreliable predictions.
method Proposes a constrained optimization approach for a monotonic calibration map.
result Achieves state-of-the-art performance across various datasets and models.

Study solves optimal portfolio selection using HJB equation.

problem Optimal portfolio selection problem.
method Maximal monotone operator method, Banach fixed-point theorem, Fourier transform, monotone operators technique.
result Existence and uniqueness of solution to HJB equation.

New method for optimizing risk in financial models using Fourier transforms.

problem Optimizing risk in financial models with multi-period mean-CVaR.
method Strictly monotone 2D integration scheme via Fourier-trained transition kernels.
result Established robust and accurate optimization method for financial models.

The paper solves a complex financial optimization problem using a novel mathematical technique.

problem Optimizing portfolio selection in financial markets.
method Maximal monotone operator method and Riccati transformation.
result Existence and uniqueness of a solution to the transformed parabolic equation in a Sobolev space.

Developed a monotone numerical method for MV portfolio optimization under jump-diffusion models.

problem Efficiently optimizing portfolios with jump-diffusion dynamics and investment constraints.
method Strictly monotone numerical integration method using Fourier transforms and composite quadrature rules.
result Proven to be \ell_{\infty}-stable and pointwise consistent, converging to the MV optimization solution.

Let X\mathcal{X} be a subset of L1L^1 that contains the space of simple random variables L\mathcal{L} and ρ:X(,]ρ: \mathcal{X} \rightarrow (-\infty,\infty] a dilatation monotone functional with the Fatou property. In this note, we show that ρρ extends uniquely to a σ(L1,L)σ(L^1,\mathcal{L}) lower semicontinuous and dilatatio…

2020-02-27abs ↗pdf ↗

Paper tackles stochastic kk-submodular bandits with full feedback, achieving sublinear regret.

problem Online optimization of kk-submodular functions with full-bandit feedback.
method Proposes online algorithms for various kk-submodular stochastic combinatorial multi-armed bandit problems.
result Achieves sublinear αα-regret bounds for multiple kk-submodular stochastic combinatorial multi-armed bandit problems.

Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is distorted by a (typically unknown) nonlinear transformation. This paper addresses the…

2015-12-29abs ↗pdf ↗

This paper introduces a novel approach for learning to rank (LETOR) based on the notion of monotone retargeting. It involves minimizing a divergence between all monotonic increasing transformations of the training scores and a parameterized prediction function. The minimization is both over the transformations as well …

2012-10-16abs ↗pdf ↗

New method makes CP intervals locally adaptive using trainable transformations.

problem Making Conformal Prediction intervals locally adaptive.
method Defining a trainable change of variables φX(A)φ_X(A) that depends on object attributes XX.
result Locally adaptive prediction intervals with guaranteed marginal validity and variable sizes.

Zeroth-order optimization is the process of minimizing an objective f(x)f(x), given oracle access to evaluations at adaptively chosen inputs xx. In this paper, we present two simple yet powerful GradientLess Descent (GLD) algorithms that do not rely on an underlying gradient estimate and are numerically stable. We analy…

2019-11-14abs ↗pdf ↗

A normalizing flow models a complex probability density as an invertible transformation of a simple base density. Flows based on either coupling or autoregressive transforms both offer exact density evaluation and sampling, but rely on the parameterization of an easily invertible elementwise transformation, whose choic…

2019-06-10abs ↗pdf ↗

Proves flows of two-convex Lagrangians are regular, global, and converge.

problem Proves regularity, global existence, and convergence of Lagrangian mean curvature flows in the two-convex case.
method Uses a newly discovered monotone quantity to control two-convexity.
result Proves results for the mean curvature flow of area-decreasing Lagrangian submanifolds.

New framework for learning KR maps from data, ensuring stable generalization.

problem Learning monotone triangular transport maps efficiently and accurately.
method General framework using invertible transformations of smooth functions, ensuring no spurious local minima.
result Unique global minimizer corresponds to the KR map under certain conditions.

In machine learning and data mining, linear models have been widely used to model the response as parametric linear functions of the predictors. To relax such stringent assumptions made by parametric linear models, additive models consider the response to be a summation of unknown transformations applied on the predict…

2017-10-16abs ↗pdf ↗

Study non-monotonic loss functions in CRC, achieving valid risk control with large calibration samples.

problem Non-monotonic loss functions in CRC, violating existing theory's monotonicity assumption.
method Finite grid selection, calibration sample size analysis, Lipschitz continuity, monotonicity, distribution shift.
result Valid CRC achieved with large calibration samples, optimal excess risk rate of log(m)/n\sqrt{\log(m)/n}.

A new method solves complex financial equations efficiently.

problem Solving worst-case and best-case prices for two-factor uncertain volatility models.
method Decompose and integrate, then optimize; piecewise constant control; closed-form Green's functions; 2D convolution integrals; monotone numerical integration; Fast Fourier Transforms.
result The method efficiently computes the value function and optimal control, converging to the viscosity solution of the HJB equation.

We propose non-stationary spectral kernels for Gaussian process regression. We propose to model the spectral density of a non-stationary kernel function as a mixture of input-dependent Gaussian process frequency density surfaces. We solve the generalised Fourier transform with such a model, and present a family of non-…

2017-05-24abs ↗pdf ↗

SISR improves feature attribution in complex payoff schemes.

problem Distorted feature attributions due to non-additive payoff functions and high-dimensional feature spaces.
method Sparse Isotonic Shapley Regression (SISR) learns a monotonic transformation to restore additivity and enforces L0 sparsity.
result SISR achieves strong support recovery and stable attributions across various payoff schemes.

A normalizing flow models a complex probability density as an invertible transformation of a simple density. The invertibility means that we can evaluate densities and generate samples from a flow. In practice, autoregressive flow-based models are slow to invert, making either density estimation or sample generation sl…

2019-06-05abs ↗pdf ↗

Insider trading is reduced when penalized, affecting expected penalties in a non-monotone way.

problem Reducing insider trading behavior when insiders face legal penalties.
method Characterized via a backward stochastic differential equation (BSDE) with a non-linear operator.
result The insider's expected penalties are non-monotone in the fee structure and determined by relative entropy.

New analysis of annealing paths in sampling and estimation.

problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.

We analyze a simple asset transfer model in which the transfer amount is a fixed fraction ff of the giver's wealth. The model is analyzed in a new way by Laplace transforming the master equation, solving it analytically and numerically for the steady-state distribution, and exploring the solutions for various values o…

2010-04-29abs ↗pdf ↗

In this paper, we consider a generalized multivariate regression problem where the responses are monotonic functions of linear transformations of predictors. We propose a semi-parametric algorithm based on the ordering of the responses which is invariant to the functional form of the transformation function. We prove t…

2016-02-19abs ↗pdf ↗

New Hermite approximations accelerate convergence with adaptive coordinate transformations.

problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.

Introduces nondecreasing rank for matrices and tensors, developing methods and applications.

problem Finding low-rank approximations for matrices and tensors with monotonic constraints.
method Developed a variant of hierarchical alternating least squares algorithm for finding low ND rank approximations.
result Low ND rank factorizations can be found and interpreted for real-world datasets.

We present new extensions to a method for constructing several families of solvable one-dimensional time-homogeneous diffusions whose transition densities are obtainable in analytically closed-form. Our approach is based on a dual application of the so-called diffusion canonical transformation method that combines smoo…

2009-07-16abs ↗pdf ↗

The paper addresses monotonicity in machine learning models for fairness and accountability.

problem Ensuring fairness and accountability in transparent machine learning models.
method Study of three types of monotonicity (individual, weak pairwise, strong pairwise) and propose monotonic groves of neural additive models.
result Monotonic groves of neural additive models maintain transparency, accountability, and fairness.

Normalizing flows and autoregressive models have been successfully combined to produce state-of-the-art results in density estimation, via Masked Autoregressive Flows (MAF), and to accelerate state-of-the-art WaveNet-based speech synthesis to 20x faster than real-time, via Inverse Autoregressive Flows (IAF). We unify a…

2018-04-03abs ↗pdf ↗

This note has an experimental nature and contains no new theorems. We introduce certain moves for classical knot diagrams that for all the very many examples we have tested them on give a monotonic complete simplification. A complete simplification of a knot diagram D is a sequence of moves that transform D into a diag…

2015-08-13abs ↗pdf ↗