Study on pairwise counter-monotonicity, a type of negative dependence.
problem Understanding and quantifying extremal negative dependence structures.
method Established stochastic representation and invariance property; showed implications and connections.
result Pairwise counter-monotonicity implies negative association and joint mix dependence.
Paper introduces CIM for detecting dependence and monotonicity between stochastic signals.
problem Detecting the strength and monotonicity structure of dependence between stochastic signals.
method Nonparametric copula-based index (CIM) that satisfies desirable properties of measures of association.
result CIM shows favorable performance in detecting monotonicity and dependence in real-world data.
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
Based on a study of the coupling by reflection of diffusion processes, a new monotonicity in time of a time-dependent transportation cost between heat distribution is shown under Bakry-Emery's curvature-dimension condition on a Riemannian manifold. The cost function comes from the total variation between heat distribut…
The paper develops algorithms to restore monotonicity in non-monotone functions.
problem Non-monotone solutions from heuristic algorithms need to be corrected.
method Develops algorithms to restore monotonicity with limited queries.
result Restores monotonicity while degrading the function value by at most ε.
This paper studies the evolution of the first eigenvalue of the p-Laplacian on time-dependent Riemannian metrics.
problem Evolution of the first eigenvalue of the p-Laplacian on time-dependent Riemannian metrics.
method Analyzes the monotonicity and differentiability of the first eigenvalue under geometric flow conditions.
result The first nonzero p-eigenvalue is monotone nondecreasing along the flow under certain geometric conditions and is differentiable almost everywhere.
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.
Develops methods to analyze feature-outcome associations in subpopulations.
problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.
New risk control method for non-monotonic losses in complex parameters.
problem Controlling risk for non-monotonic losses with multidimensional parameters.
method Stability-based guarantees for generic algorithms applied to non-monotonic losses.
result Guarantees depend on algorithm stability, with looser guarantees for unstable algorithms.
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.
New method tackles adversarial sign-corrupted isotonic regression, estimating monotonic signals under heavy dependence.
problem Estimating monotonic signals when responses are sign-corrupted and adversarially designed to violate monotonicity.
method Developed ASCIFIT, a three-step estimation procedure using PAVA with pre- and post-processing corrections.
result Theoretical guarantees of sharp high probability upper bounds and minimax lower bounds for ASCIFIT.
The paper evaluates joint life insurance risk under dependence uncertainty using copulas and convex risk measures.
problem Evaluating risk of joint life insurance products under uncertainty in dependence structure.
method Monotonicity of risk evaluation with concordance order, linear programming for bounds, and numerical analysis.
result Bounds for mean, Value-at-Risk, and Expected Shortfall computed using linear programs.
The paper analyzes high-dimensional kernel regression, showing different risk curves based on data and regularization.
problem Characterizing generalization properties of high-dimensional kernel ridge regression.
method Bias-variance decomposition of the expected excess risk, considering different regularization schemes and data eigen-profiles.
result The risk curve of kernel regression can be double-descent-like, bell-shaped, or monotonic, depending on n, d, and regularization level.
Turnpike results for risk tolerance in incomplete markets under time-monotone criteria.
problem Turnpike results for risk tolerance in incomplete markets under time-monotone criteria.
method Time-monotone forward performance criteria, analysis of limits, dependence on measure support.
result Temporal and spatial limits do not coincide and depend on measure support.
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.
Productivity and credit limits affect aggregate production in non-monotonic ways.
problem Understanding how aggregate production is influenced by individual characteristics and financial constraints.
method Analytical proof of non-monotonic effects of productivity and credit limits on aggregate production in a general equilibrium model.
result Equilibrium aggregate production can be non-monotonic in both individual productivity and credit limit.
New method learns relationships between independent data.
problem Learning relationships between independent data sets.
method A mix of quantile matching and deconvolution, requiring monotone dependency.
result Can be combined with matching to leverage both methods.
Study finds non-monotonic Value of Information in dynamic multi-market monopoly.
problem Investigates non-monotonicity in Value of Information for a price-setting monopolist.
method Uses a Bayesian inverse problem with Kalman-Bucy-Stratonovich filter in a dynamic discrete model.
result Non-monotonic relationship between signal variance and Value of Information.
The paper investigates how multi-label evaluation metrics can prune rule search space.
problem Challenges in inducing rules with multiple labels in multi-label classification.
method Examines anti-monotonicity and decomposability properties of multi-label evaluation metrics.
result Commonly used multi-label evaluation metrics exhibit anti-monotonicity, aiding rule search space pruning.
We characterize when the level sets of a continuous quasi-monotone functional defined on a suitable convex subset of a normed space can be uniquely represented by a family of bounded continuous functionals. Furthermore, we investigate how regularly these functionals depend on the parameterizing level. Finally, we show …
Local Sobolev inequality on Ricci flows with applications.
problem Understanding the local geometry of Ricci flows.
method Proving a local Sobolev inequality for Ricci flows.
result The local ν-functional depends only on the Nash entropy at the center of a disk.
New tail dependence measures for stock indices.
problem Measuring tail dependence between financial variables.
method Introducing a new stochastic order and studying monotone tail dependence measures.
result Advantage of new tail dependence measures over classical ones.
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.
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} log ( m ) / n . ThiopheneIV is a new solver for implied volatility with proven monotonicity.
problem Efficiently solving implied volatility in financial models.
method Monotone core with Euler-Chebyshev and Halley steps, exact arithmetic proof, practical boundary handling.
result ThiopheneIV agrees closely with multiprecision Black reference prices at low latency.
Paper tackles non-monotone DR-submodular maximization with approximation and regret guarantees.
problem Maximizing non-monotone DR-submodular functions over specific sets.
method Frank-Wolfe algorithm for general convex sets, Stochastic Gradient Ascent for down-closed convex sets.
result First approximation guarantees for both offline and online settings.
New kernels model non-stationary data efficiently.
problem Efficiently modeling non-stationary data with Gaussian processes.
method Model spectral density as a mixture of frequency surfaces, solve generalised Fourier transform.
result Derives efficient inference methods for non-stationary kernels.
New method improves submodular maximization for machine learning applications.
problem Inexact monotonicity in submodular functions limits traditional algorithms' performance.
method Introduces monotonicity ratio as a continuous version of monotonicity, leading to improved approximation guarantees.
result Improved approximation ratios for movie recommendation, quadratic programming, and image summarization.
Improves active learning efficiency by warping input space based on observed outputs.
problem Insensitivity of Gaussian process uncertainty to actual observations.
method Input warping with learned monotone reparameterization to adjust acquisition function behavior.
result Significantly improved sample efficiency across various benchmarks, especially in non-stationary conditions.
The monotonic linear interpolation in deep networks often leads to plateaus, revealing biases in optimization.
problem Plateaus in the optimization landscape of deep networks during monotonic linear interpolation.
method Investigated monotonic linear interpolation on deep neural networks, focusing on biases in weights and biases.
result Interpolating weights and biases differently can lead to significant differences in loss and accuracy, revealing biases in optimization.
The paper analyzes Variable Annuities with surrender charges, providing a pricing formula and optimal exercise boundary.
problem Analyzing Variable Annuities with surrender charges and early termination rights.
method Formulated as an optimal stopping problem with a discontinuous payoff, non-monotonic optimal stopping boundaries are proven continuous and regular.
result A rigorous pricing formula and optimal exercise boundary for surrender options are derived.
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.
Stabilization technique applied to curve shortening flow in 3D space.
problem Stabilizing curve shortening flow in 3D space.
method Applying stabilization technique developed by T. Zelenyak to curve shortening flow in R 3 \mathbb{R}^3 R 3 . result Derivation of several new monotonicity formulas for curve shortening flow.
This paper analyzes and improves monotonic accelerated algorithms like M-NAG and M-FISTA.
problem Establishing linear convergence of M-NAG and M-FISTA under strong convexity.
method Lyapunov analysis and modified Lyapunov functions.
result Linear convergence of M-NAG and M-FISTA is guaranteed without full NAG iterates.
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.
Classifies treatment responders using monotonic causal effects.
problem Predicting treatment response based on features and past examples.
method Developed discriminative and generative algorithms leveraging monotonicity.
result New algorithms outperform standard benchmarks in responder classification.
Mathematical analysis shows Brexit affects EU voting power in unexpected ways.
problem Effects of Brexit on EU voting power and distribution of power.
method Mathematical analysis using Penrose--Banzhaf Index and normal approximation.
result Non-monotonic effects of Brexit on EU voting power, exacerbated by EU population vector.
Differentiable sorting and rank normalization are incompatible, with specific conditions for admissibility.
problem Incompatibility between differentiable sorting and rank normalization.
method Formalized admissibility through monotone invariance, batch independence, and rank-space stability conditions.
result Different gap-sensitive and batchwise relaxations of rank normalization violate the conditions for admissibility.
Survival regression method improves log-likelihood scores.
problem Improper scoring rules in survival regression models.
method SurvivalMonotonic-net (SuMo-net) with monotonic neural networks.
result SuMo-net achieves state-of-the-art log-likelihood scores.
Paper proposes DSBA, a stochastic algorithm for decentralized learning that converges faster and uses sparse communication.
problem Efficient decentralized learning with sparse communication for complex problems.
method Generalizes decentralized optimization to monotone operator root finding, proposes DSBA algorithm.
result DSBA converges geometrically with a rate linearly depending on problem condition number and uses sparse communication.
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 tackles nonlinear factor models with unknown monotone links from incomplete and noisy data.
problem Learning nonlinear factor models with unknown monotone links from incomplete and noisy data.
method Formulated as joint recovery of low-rank factors, loadings, and nonlinear link function; proposed BCD algorithm with regularization.
result Established convergence guarantees and sublinear regret bounds for link-function updates.
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) φ X ( A ) that depends on object attributes X X X . result Locally adaptive prediction intervals with guaranteed marginal validity and variable sizes.
New algorithm achieves asymptotically optimal regret without horizon dependence.
problem Horizon-free regret minimization for reinforcement learning.
method Proposes a new algorithm and proves a regret upper bound.
result Regret upper bound of \(\tilde O(\sqrt{SAK} + S^8A^3)\) with failure probability \(\delta\).
Cube category simplifies set modeling.
problem Modeling set operations efficiently.
method Introducing interval-preserving monotone functions between finite Boolean lattices.
result Cube category facilitates model structures equivalent to simplicial sets.
Two new algorithms solve high-dimensional optimization problems without gradients.
problem Optimizing complex, high-dimensional functions without gradient information.
method GradientLess Descent (GLD) algorithms that use evaluations at adaptively chosen inputs.
result Converges within an ε-ball of the optimum with a number of evaluations that is poly-logarithmic in dimensionality.
A new flow family reduces to Li-Yuan-Zhang's and can lead to convergence under certain conditions.
problem Establishing convergence of coupled flow equations under various conditions.
method Introducing a one-parameter family of coupled flows and applying C 0 C^0 C 0 estimates and monotonicity of energy functionals. result Convergence of the flow can be established for κ e q 1 κ
eq 1 κ e q 1 under suitable conditions. In this paper we consider backward stochastic differential equations with time-delayed generators of a moving average type. The classical framework with linear generators depending on ( Y ( t ) , Z ( t ) ) (Y(t),Z(t)) ( Y ( t ) , Z ( t )) is extended and we investigate linear generators depending on ( 1 t ∫ 0 t Y ( s ) d s , 1 t ∫ 0 t Z ( s ) d s ) (\frac{1}{t}\int_0^tY(s)ds, \frac{1}{t}\int_0^tZ(s)ds) ( t 1 ∫ 0 t Y ( s ) d s , t 1 ∫ 0 t Z ( s ) d s ) . We…