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

Trend · papers per month

85171256341 · Jun 202019922001200920172026
48 results for monotonic ordering

Improved algorithms for convex-concave min-max optimization and monotone variational inequalities.

problem Efficiently solving constrained convex-concave min-max problems and monotone variational inequalities.
method Higher-order methods achieving iteration complexities of O(1/T^{ rac{p+1}{2}}) for p-th order derivatives.
result Achieved improved convergence rates for min-max and monotone variational inequalities.

Nonnegative matrix factorization (NMF) factorizes a non-negative matrix into product of two non-negative matrices, namely a signal matrix and a mixing matrix. NMF suffers from the scale and ordering ambiguities. Often, the source signals can be monotonous in nature. For example, in source separation problem, the source…

2015-05-01abs ↗pdf ↗

The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space, (2) the attainment of the supremum in the dual representation by order-continuous…

2013-05-10abs ↗pdf ↗

The paper defines new geometric concepts on Riemannian manifolds and applies them to optimization problems.

problem Optimization problems on Riemannian manifolds.
method Strongly geodesic preinvexity, strongly η-invexity, and strongly invariant η-monotonicity definitions.
result Characterization of strict η-minimizers and solutions to variational like-inequality problems.

We propose a new framework for imposing monotonicity constraints in a Bayesian nonparametric setting based on numerical solutions of stochastic differential equations. We derive a nonparametric model of monotonic functions that allows for interpretable priors and principled quantification of hierarchical uncertainty. W…

2019-05-30abs ↗pdf ↗

The paper studies Steklov eigenvalues in space forms and warped product manifolds, deriving bounds and monotonicity results.

problem Estimating Steklov eigenvalues in space forms and warped product manifolds.
method Monotonicity results for Steklov eigenvalues in geodesic disks and warped product manifolds with non-negative Ricci curvature.
result Sharp bounds and monotonicity results for Steklov eigenvalues on warped product manifolds.

Non-affine aggregation rules cannot preserve monotonicity in convex learning.

problem Designing non-affine aggregation rules that maintain monotonicity in convex learning.
method Proving that monotonicity of aggregated gradients is preserved only if the aggregation rule is positively affine.
result Non-affine aggregation prevents steady convergence and substantially degrades algorithmic stability.

MCNet improves uncertainty calibration in online advertising by modeling complex relations and balancing performance.

problem Lack of effective calibration for complex relations and context features in online advertising.
method Introduces MCNet with MCF, order-preserving, and field-balance regularizers.
result Superior performance in generating well-calibrated probability predictions on public and industrial datasets.

Holonomy groups of metric connections converge in a monotonic way.

problem Monotonicity of holonomy groups under convergence of metric connections.
method Proving the monotonicity of holonomy groups for sequences of metric connections converging in C0C^0.
result The holonomy group of the limit connection is contained in the holonomy group of the initial connections.

Monotonic policy improvement and off-policy learning are two main desirable properties for reinforcement learning algorithms. In this paper, by lower bounding the performance difference of two policies, we show that the monotonic policy improvement is guaranteed from on- and off-policy mixture samples. An optimization …

2017-10-10abs ↗pdf ↗

In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution pp over a poset is monotone if, for any pair of domain elements xx and yy such that xyx \preceq y, p(x)p(y)p(x) \leq p(y). To understand the sample complexity of this problem, we intro…

2019-07-06abs ↗pdf ↗

Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that operate in non-monotonic orders; the model directly learns good orders, without any ad…

2019-02-05abs ↗pdf ↗

When training data is sparse, more domain knowledge must be incorporated into the learning algorithm in order to reduce the effective size of the hypothesis space. This paper builds on previous work in which knowledge about qualitative monotonicities was formally represented and incorporated into learning algorithms (e…

2012-07-04abs ↗pdf ↗

Given a monotone convex function on the space of essentially bounded random variables with the Lebesgue property (order continuity), we consider its extension preserving the Lebesgue property to as big solid vector space of random variables as possible. We show that there exists a maximum such extension, with explicit …

2013-04-30abs ↗pdf ↗

Strong geodesic convex function and strong monotone vector field of order mm on Riemannian manifolds have been established. A characterization of strong geodesic convex function of order mm for the continuously differentiable functions has been discussed. The relation between the solution of a new variational inequal…

2017-05-29abs ↗pdf ↗

The paper explores capital allocation using Euler formula with VaR and ES, revealing non-monotonicity and providing estimation methods.

problem Non-monotonicity in VaR-based capital allocation and the need for consistent risk measures.
method Use of Euler formula, Value-at-Risk (VaR), Expected shortfall (ES), simulation, and Markov chain Monte Carlo.
result Capital allocation with VaR is not monotonous, and consistent risk measures are crucial.

Develops a first-order interior-point method for solving constrained variational inequalities.

problem Solving constrained variational inequalities with nontrivial constraints.
method ADMM-based interior-point method for constrained VIs (ACVI).
result First-order interior-point method with global convergence guarantees for general cVI problems.

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}.

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.

Zamolodchikov's c-theorem type argument (and also string theory effective action constructions) imply that the RG flow in 2d sigma model should be gradient one to all loop orders. However, the monotonicity of the flow of the target-space metric is not obvious since the metric on the space of metric-dilaton couplings is…

2006-12-29abs ↗pdf ↗

Monotone aggregation of dependent random vectors has an absolutely continuous distribution under certain conditions.

problem Monotone aggregation of dependent random vectors
method Coordinatewise monotonicity and uniform lower-increment conditions
result One-dimensional push-forwards of dependent random vectors have an absolutely continuous distribution

New positive mass theorem for hyperbolic 3-manifolds using Green functions.

problem Proving a positive mass theorem for asymptotically hyperbolic 3-manifolds.
method Using a monotonicity formula for the Green function of the Laplace operator.
result Established a new positive mass theorem for three-dimensional manifolds.

A new learning rule consistently reduces error over data samples.

problem Finding a learning rule that consistently reduces error over all data distributions.
method A deterministic, data-dependent partitioning rule that only partitions cyclic intervals with sufficient empirical diversity of labels.
result The expected error is monotone non-increasing with the sample size under every data distribution.

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.

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 ↗

The paper characterizes optimal dynamic portfolios for a modified mean-variance utility.

problem Optimal dynamic portfolio choice for a modified mean-variance utility.
method Complete characterization under minimal assumptions, no restrictions on asset return moments.
result Maximal MMV utility is linked to the monotone Sharpe ratio, with global squared MSR as the nominal yield.

New insights into variational inference using Monte Carlo estimates.

problem Improving variational bounds in latent variable models.
method Analyzing properties of Monte Carlo estimates and their impact on variational gaps.
result Negative correlation reduces variational gaps, contrary to intuition.

This paper shows how to learn variational inequalities fast with strong monotonicity.

problem Learning variational inequalities efficiently.
method Extending convex optimization techniques to variational inequalities with strong monotonicity.
result Fast generalization rates of Θ(1/ε)Θ(1/ε) for learning variational inequalities.

The paper examines the unexpected losses and risk ratios for co-monotonic alternatives in large portfolios.

problem Understanding the unexpected losses and risk ratios for large portfolios with co-monotonic alternatives.
method Analyzes the asymptotic behavior of unexpected losses and risk ratios for co-monotonic alternatives using monotone cash-additive risk measures and Choquet insurance premia.
result Unexpected losses of large weighted portfolios are of order o(nλn)o(n\overlineλ_n), where λn\overlineλ_n is the average weight.

Gradient descent dynamics in quadratic regression models are analyzed, revealing five phases: monotonic, catapult, periodic, chaotic, and divergent.

problem Analyzing the dynamics of gradient descent in quadratic regression models.
method Fine-grained bifurcation analysis of gradient descent dynamics using a cubic map parameterized by the step-size.
result Gradient descent dynamics in quadratic regression models exhibit five distinct phases: monotonic, catapult, periodic, chaotic, and divergent.

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.

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.

Derives a new formula for optimal stopping problems with exploding derivatives.

problem Optimal stopping problems with complex boundary conditions.
method Develops a change of variable formula for functions with exploding derivatives near a surface.
result Derives a formula similar to Itô's but with less restrictive conditions.

Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.

problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild assumptions.

The paper tackles non-monotonic learning performance and proposes algorithms to make models more monotone.

problem Non-monotonic learning performance where more data does not always improve model quality.
method Proposes three algorithms to make supervised learning models more monotone, proving consistency and monotonicity with high probability.
result The algorithm MT-HT reduces less than 1% non-monotonic decisions on MNIST while maintaining competitive error rates.