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

Trend · papers per month

55110165220 · Jun 202019922001200920172026
48 results for monotonically non-increasing cost

SSFN self-estimates network size with low complexity and consistent performance.

problem Designing a self-estimating feed-forward network with low complexity and consistent performance.
method Joint optimization for layer and node estimation, low computational complexity, and use of lossless flow property and convex optimization.
result Consistent performance across Monte-Carlo trials and monotonically non-increasing cost with network growth.

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.

Study de Rham homomorphism for Lipschitz cohomologies on metric simplicial complexes.

problem Triviality of de Rham homomorphism kernel and non-increasing monotonicity of parameters.
method Regularization in Lipschitz de Rham calculus on metric simplicial complexes with bounded geometry.
result Explicit specification of non-trivial cohomology classes for a sequence of parameters.

The paper extends the avoidance principle for mean curvature flows, proving new intersection dimension monotonicity results.

problem Understanding the behavior of intersections in mean curvature flows.
method Proving new intersection dimension monotonicity results for mean curvature flows, Brakke flows, and level set flows.
result The dimension of the intersection of mean curvature flows is non-increasing over time.

A quaternionic contact (qc) heat equation and the corresponding qc energy functional are introduced. It is shown that the qc energy functional is monotone non-increasing along the qc heat equation on a compact qc manifold provided certain positivity conditions are satisfied.

2016-08-01abs ↗pdf ↗

Adaptive learning rate improves FTRL's performance in online learning.

problem Optimizing FTRL's learning rate for competitive regret in online learning.
method Formulated as a sequential decision-making problem, introduced competitive analysis framework, and proposed stability-penalty matching update rules.
result Achieved a constant competitive ratio under specific conditions, enabling Best-Of-Both-Worlds algorithms.

We show that on a manifold whose Riemannian metric evolves under backwards Ricci flow two Brownian motions can be coupled in such a way that the expectation of their normalized L-distance is non-increasing. As an immediate corollary we obtain a new proof of a recent result of Topping (J. reine angew. Math. 636 (2009), …

2010-07-08abs ↗pdf ↗

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.

In this paper, we study the evolution of L2 p-forms under Ricci flow with bounded curvature on a complete non-compact or a compact Riemannian manifold. We show that under curvature pinching conditions on such a manifold, the L2 norm of a smooth p-form is non-increasing along the Ricci flow. The L^{\infty} norm is showe…

2007-01-15abs ↗pdf ↗

The paper studies nodal sets of solutions to parabolic equations, proving finiteness and monotonicity properties.

problem Analyzing nodal sets of solutions to parabolic equations with general coefficients.
method Generalized methods to handle time-dependent and Lipschitz continuous coefficients.
result Finiteness and monotonicity properties of the (n1)(n-1)-dimensional Hausdorff measure of nodal sets.

The entropy of a hypersurface is given by the supremum over all F-functionals with varying centers and scales, and is invariant under rigid motions and dilations. As a consequence of Huisken's monotonicity formula, entropy is non-increasing under mean curvature flow. We show here that a compact mean convex hypersurface…

2014-09-05abs ↗pdf ↗

In this paper, we first introduce the weighted forward reduced volume of Ricci flow. The weighted forward reduced volume, which related to expanders of Ricci flow, is well-defined on noncompact manifolds and monotone non-increasing under Ricci flow. Moreover, we show that, just the same as the Perelman's reduced volume…

2010-11-02abs ↗pdf ↗

We consider a closed manifold M with a Riemannian metric g(t) evolving in direction -2S(t) where S(t) is a symmetric two-tensor on (M,g(t)). We prove that if S satisfies a certain tensor inequality, then one can construct a forwards and a backwards reduced volume quantity, the former being non-increasing, the latter be…

2009-05-14abs ↗pdf ↗

In this paper, we investigate the behavior of ADM mass and Einstein-Hilbert functional under the Yamabe flow. Through studying the Yamabe flow by weighted spaces, we show that ADM mass and Einstein-Hilbert functional are well-defined and monotone non-increasing under the Yamabe flow on nn-dimensional, n3n\geq 3, asymp…

2011-09-12abs ↗pdf ↗

Maps between positively curved manifolds with non-increasing area are rigid.

problem Understanding maps between manifolds with positive curvature and non-increasing area.
method Exploring the graphical mean curvature flow and using Brendle's sphere theorem.
result Maps between certain positively curved manifolds are homotopy trivial, Riemannian submersion, local isometry, or isometric immersion.

Study of loss functions for learning to defer, proving consistency.

problem Learning to defer in machine learning.
method Introduced a family of surrogate losses parameterized by ΨΨ and proved their consistency.
result Proved realizable HH-consistency and Bayes-consistency of specific surrogate losses.

Investigates how trading boundaries change with transaction costs in portfolio selection.

problem Investigates how trading boundaries vary with transaction costs in portfolio selection.
method Analyzes Merton's problem with proportional transaction costs, showing monotonicity of trading boundaries.
result Cost-adjusted trading boundaries are monotone in transaction costs, with implications for the Merton line.

A new algorithm finds minimizers in dueling optimization with a monotone adversary.

problem Finding minimizers in dueling optimization with a monotone adversary.
method Introduces and studies dueling optimization with a monotone adversary, designs an efficient randomized algorithm.
result Efficient algorithm incurs cost O(d)O(d) and iteration complexity O(dlog(1/ε)2)O(d\log(1/\varepsilon)^2), asymptotically optimal.

Study shows mean field games can have multiple solutions under certain conditions.

problem Analysis of mean field games with anti-monotone running costs.
method Examined an N+1N+1-player game and mean field game with state space {0,1}, considering a minimum jumping rate.
result Mean field game equation may have multiple solutions if a specific condition is met.

ExKMC improves explainable kk-means clustering by balancing accuracy and simplicity.

problem Limited explainable methods for unsupervised learning.
method Develops ExKMC, a new algorithm that uses a decision tree with kk' leaves to explain kk-means clustering, trading explainability for accuracy.
result ExKMC produces a low-cost clustering that outperforms existing methods.

This paper optimizes periodic dividend strategies for Lévy processes with transaction costs.

problem Maximizing dividends for spectrally negative Lévy processes with fixed transaction costs.
method Using periodic strategies and fixed transaction costs, the paper calculates the value function and shows optimality conditions.
result A sufficient condition for optimality is that the Lévy measure is completely monotonic.

This paper benchmarks monotone-constrained models for credit PD across datasets and finds constraints are mostly costless.

problem Aligning machine learning model behavior with domain knowledge in credit risk.
method Benchmarked monotone-constrained versus unconstrained gradient boosting models across five datasets and three libraries, defining the Price of Monotonicity (PoM) as the relative change in AUC.
result Monotonicity constraints are almost costless on large datasets and most costly on smaller datasets, with PoM ranging from essentially zero to about 2.9 percent.

Sequence-to-sequence models with soft attention have been successfully applied to a wide variety of problems, but their decoding process incurs a quadratic time and space cost and is inapplicable to real-time sequence transduction. To address these issues, we propose Monotonic Chunkwise Attention (MoChA), which adaptiv…

2017-12-14abs ↗pdf ↗

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.

Additive Gaussian process framework handles monotonicity constraints in high dimensions.

problem Handling monotonicity constraints in high-dimensional data.
method Additive Gaussian process framework with MaxMod algorithm for dimension reduction.
result Framework enables to satisfy monotonicity constraints everywhere in the input space.

Study on regularity of optimal transport maps on convex domains with quadratic cost.

problem Regularity of optimal transport maps between convex domains with quadratic cost.
method Analysis of CαC^α-densities and C1,αC^{1, α} boundary conditions, monotonicity formula for optimal transport maps.
result Proves C1,1εC^{1, 1-\varepsilon}-regularity for nondegenerate CαC^α-densities and C2,αC^{2, α}-regularity for C1,αC^{1, α} boundary.

In this paper, we consider a kind of area preserving non-local flow for convex curves in the plane. We show that the flow exists globally, the length of evolving curve is non-increasing, and the curve converges to a circle in C^{\infty} sense as time goes into infinity.

2009-07-09abs ↗pdf ↗

The paper tackles online learning problems with monotone arm sequences, achieving optimal or near-optimal regret bounds.

problem Online learning problems with ordinal and monotone arm sequences, such as dynamic pricing and clinical trials.
method Proposes algorithms for continuum-armed bandit problems with monotone arm sequences, achieving optimal or near-optimal regret bounds.
result Achieves optimal or near-optimal regret bounds for monotone arm sequences, differing from the continuous-armed bandit literature.

Monotonic neural additive models simplify machine learning for credit scoring.

problem Complex machine learning methods make models less transparent and fair.
method Introducing monotonic neural additive models that simplify neural networks while maintaining regulatory compliance.
result Monotonic neural additive models achieve similar accuracy to complex neural networks but are more transparent and fair.

The study proves that sets with constant nonlocal curvature are composed of equal balls under certain conditions.

problem Characterizing sets with constant nonlocal curvature.
method Analyzing measurable sets in R^d with constant nonlocal h-mean curvature under a suitable integrability assumption.
result Finite unions of equal balls are the only sets with constant nonlocal curvature under the given conditions.

Optimal DP mechanisms for vector queries are found to be staircase distributions.

problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.

Develops a two-level monotonic multistage recommender system for better user-specific prediction.

problem Leveraging user-item-stage dependencies in a monotonic chain of events for enhanced prediction accuracy.
method A multistage recommender system with a two-level monotonic property, using a large-margin classifier based on a nonnegative additive latent factor model.
result The proposed method outperforms existing methods in simulations and an article sharing dataset.

New algorithm reduces RL complexity with low switching costs.

problem Exploration-exploitation dilemma in RL with complex models.
method Monotonic Q-Learning with Upper Confidence Bound (MQL-UCB) for RL with general function approximation.
result Achieves minimax optimal regret of O(dHK)O(d\sqrt{HK}) and near-optimal policy switching cost.

The paper addresses fairness issues in screening classifiers, proposing within-group monotonicity to avoid unfair treatment of qualified candidates.

problem Within-group unfairness in screening classifiers using calibrated models.
method Introducing within-group monotonicity as a property to avoid unfair treatment and developing an efficient post-processing algorithm based on dynamic programming.
result Within-group monotonicity can be achieved efficiently and often at a small cost, improving fairness without significantly compromising prediction accuracy.

In this article we consider a special case of an optimal consumption/optimal portfolio problem first studied by Constantinides and Magill and by Davis and Norman, in which an agent with constant relative risk aversion seeks to maximise expected discounted utility of consumption over the infinite horizon, in a model com…

2014-09-11abs ↗pdf ↗

This work clarifies different transport map constructions and their causal interpretations.

problem Identifying distinct transport map constructions and their equivalence.
method Comparative analysis of three transport map constructions: cyclically monotone, quantile-preserving, and triangular monotone.
result Conditions for equivalence of different transport map constructions.