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

58116173231 · Jun 202019922001200920172026
48 results for Monotonic Increasing

Study shows configuration spaces' homological dimension increases monotonically.

problem Understanding the homological properties of configuration spaces of manifolds.
method Analyzing the homological monotonicity of unordered configuration spaces of manifolds.
result Homological dimension of configuration spaces increases monotonically in each degree.

GradaGrad adapts learning rate non-monotonically, overcoming AdaGrad's step size decrease.

problem Fixed learning rate in AdaGrad leads to step size decrease over time.
method Introduces GradaGrad, which grows or shrinks the learning rate based on a different accumulation in the denominator.
result GradaGrad achieves similar convergence rates as AdaGrad and demonstrates non-monotone adaptation.

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.

This article investigates when homotopies can be converted to monotone homotopies without increasing the lengths of curves. A monotone homotopy is one which consists of curves which are simple or constant, and in which curves are pairwise disjoint. We show that, if the boundary of a Riemannian disc can be contracted th…

2017-04-20abs ↗pdf ↗

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 ↗

Recent reports have described that the equivalent sample size (ESS) in a Dirichlet prior plays an important role in learning Bayesian networks. This paper provides an asymptotic analysis of the marginal likelihood score for a Bayesian network. Results show that the ratio of the ESS and sample size determine the penalty…

2012-03-15abs ↗pdf ↗

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.

The study calculates Weyl entropy in spacetime regions and shows its monotonic behavior.

problem Calculating and understanding Weyl entropy in spacetime regions.
method Introducing a candidate density for Weyl entropy in perfect fluid regions and analyzing its behavior in compact spacetime regions.
result Weyl entropy is shown to be monotonic in time and maximal in vacuum static metrics.

This work is devoted to the study of parabolic frequency for solutions of the heat equation on Riemannian manifolds. We show that the parabolic frequency functional is almost increasing on compact manifolds with nonnegative sectional curvature, which generalizes a monotonicity result proved by C. Poon and by L. Ni. The…

2018-04-25abs ↗pdf ↗

New models ensure monotonicity in preference learning, improving accuracy especially with limited data.

problem Failure of widely used preference learning models to maintain monotonicity.
method Proposed Linear Generalized Bradley-Terry models with Diffusion Priors.
result New models improve accuracy, especially with limited data.

New findings show privacy affects generalization error in a non-monotonic way.

problem Privacy and robustness in distributed learning.
method Theoretical analysis and matching lower/upper bounds on algorithmic stability.
result Generalization error is non-monotonically affected by privacy, depending on noise level.

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 main purpose of this note is to construct two functionals of the positive solutions to the conjugate heat equation associated to the metrics evolving by the conformal Ricci flow on closed manifolds. We show that they are nondecreasing by calculating the explicit evolution formulas of these functionals. For the entr…

2019-10-10abs ↗pdf ↗

Plotting a learner's average performance against the number of training samples results in a learning curve. Studying such curves on one or more data sets is a way to get to a better understanding of the generalization properties of this learner. The behavior of learning curves is, however, not very well understood and…

2019-07-11abs ↗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.

This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to an optimal stopping time problem with state constraint, and then in a Markovian…

2015-03-31abs ↗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.

Investigates probability of error in structured thresholding bandit problems.

problem Probability of misclassifying arms in structured thresholding bandit problems.
method Analyzes two shape constraints: monotonic increasing and concave sequences of arm means.
result Upper and lower bounds for the probability of error match up to constants in the problem dependent regime.

We propose some natural generalizations of Reidemeister moves that do not increase the number of crossings in the generated diagrams. Experimentations make us conjecture that this class of monotonic moves is complete for computing canonical forms and then deciding isotopy.

2007-07-08abs ↗pdf ↗

Given a matrix the seriation problem consists in permuting its rows in such way that all its columns have the same shape, for example, they are monotone increasing. We propose a statistical approach to this problem where the matrix of interest is observed with noise and study the corresponding minimax rate of estimatio…

2016-07-08abs ↗pdf ↗

Proves existence and uniqueness of viscosity solutions to complex Hessian equations on compact Hermitian manifolds.

problem Existence and uniqueness of viscosity solutions to complex Hessian equations.
method Proves existence and uniqueness using viscosity solutions and determinant domination conditions.
result Viscosity solutions exist and are unique under certain conditions.

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.

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 ↗

In this paper, we mainly investigate continuity, monotonicity and differentiability for the first eigenvalue of the pp-Laplace operator along the Ricci flow on closed manifolds. We show that the first pp-eigenvalue is strictly increasing and differentiable almost everywhere along the Ricci flow under some curvature a…

2009-12-24abs ↗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.

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 ↗

Two new methods improve monotonic constraint enforcement in regression and classification trees.

problem Improving monotonic constraints in regression and classification trees.
method Proposed two new methods: one yields better results than LightGBM, the other yields even better results but is slower.
result The best method consistently beats the current implementation of LightGBM, achieving up to 1% loss reduction.

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 ↗

We analyze the sample complexity of the thresholding bandit problem, with and without the assumption that the mean values of the arms are increasing. In each case, we provide a lower bound valid for any risk δδ and any δδ-correct algorithm; in addition, we propose an algorithm whose sample complexity is of the same o…

2017-11-13abs ↗pdf ↗

We study an optimal liquidation problem under the ambiguity with respect to price impact parameters. Our main results show that the value function and the optimal trading strategy can be characterized by the solution to a semi-linear PDE with superlinear gradient, monotone generator and singular terminal value. We also…

2019-09-02abs ↗pdf ↗