Improves k-NN for monotonic data with robustness against noise.
problem Class noise in real-life data violates monotonic constraints in k-NN.
method Monotonic Fuzzy k-NN (MonFkNN) with new fuzzy membership calculation.
result Significant accuracy improvements and robustness against monotonic noise.
Monotonic differentiable sorting networks improve upon previous methods.
problem Non-monotonicity in differentiable sorting networks.
method Relaxation of conditional swap operations using sigmoid functions to ensure monotonicity.
result Monotonic differentiable sorting networks improve upon previous methods.
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.
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.
Monotone neural networks can approximate and interpolate functions efficiently.
problem Understanding the efficiency and expressiveness of monotone neural networks.
method Solving the monotone interpolation problem using depth-4 networks and comparing size bounds with arbitrary networks.
result Monotone neural networks can approximate and interpolate functions efficiently, but may require exponential size in high dimensions.
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 …
UMNNs improve density estimation and variational inference without constraints.
problem Creating expressive invertible transformations without constraints.
method Proposed UMNN architecture enforcing monotonicity with a free-form neural network.
result UMNNs enhance autoregressive flows for density estimation and variational inference.
We propose an algorithm for a family of optimization problems where the objective can be decomposed as a sum of functions with monotonicity properties. The motivating problem is optimization of hyperparameters of machine learning algorithms, where we argue that the objective, validation error, can be decomposed as mono…
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 ε.
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.
COMET learns monotonic neural networks by incorporating counterexamples.
problem Enforcing monotonicity constraints in neural networks for real-world tasks.
method Counterexample-guided learning technique for ReLU neural networks.
result COMET achieves state-of-the-art results and improves model quality.
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.
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.
Study optimal portfolio allocation in a general semimartingale model.
problem Dynamic optimal portfolio allocation under monotone mean-variance preferences.
method New results in semimartingale theory applied to Sharpe ratio analysis.
result Characterization of circumstances for improving mean-variance efficiency.
The study establishes lower bounds for testing monotonicity of distributions over posets.
problem Testing monotonicity of distributions over general posets.
method Introducing the bigness property, establishing lower bounds, and providing tools for analyzing sample complexity.
result Lower bounds of Ω(n/ln n) for testing monotonicity over specific posets.
Proposes learnable monotonic functions to improve softmax's limitations.
problem Softmax's limited representational capacity in large output vocabularies.
method Learn parametric monotonic functions on logits.
result Improves quality metrics over traditional Linear-Softmax in language models.
Novel framework for efficient Gaussian process models with monotonicity constraints.
problem Improving predictive accuracy and reducing uncertainty in high-dimensional problems with monotonicity constraints.
method Virtual point-based framework using regularized linear randomize-then-optimize (RLRTO) and No U-Turn Sampler (NUTS) for efficient sampling.
result Significant improvements in computational efficiency with the RLRTO method and NUTS enhancements.
The paper proves learning-curve monotonicity for maximum likelihood estimators in various parametric settings.
problem Establishing monotonicity guarantees for maximum likelihood estimators.
method Variants of GPT-5.2 Pro were used to derive the results.
result The paper proves monotonicity for maximum likelihood estimators in Gaussian and Gamma variables.
Improved analysis of extragradient methods for structured VIPs.
problem Efficiently solving large-scale VIPs with weaker conditions.
method Single-call stochastic extragradient methods with expected residual condition.
result Convergence guarantees for quasi-strongly monotone and weak Minty VIPs.
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.
This work shows MLPs can approximate monotonic functions without bounded activations.
problem Optimizing MLPs with monotonic constraints and bounded activations.
method Generalized theoretical results showing MLPs with non-negative weights and saturating activations are universal approximators.
result MLPs with non-negative weights and saturating activations are universal approximators for monotonic functions.
We prove a "gluing" theorem for monotone homotopies; a monotone homotopy is a homotopy through simple contractible closed curves which themselves are pairwise disjoint. We show that two monotone homotopies which have appropriate overlap can be replaced by a single monotone homotopy. The ideas used to prove this theorem…
New methods solve MI problems with locally Lipschitz operators, improving solution efficiency.
problem Solving monotone inclusions with locally Lipschitz continuous operators.
method Primal-dual extrapolation methods using backtracking line search.
result Improved operation complexity for solving MI problems.
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…
The paper addresses estimating long-term treatment effects with monotone missing data.
problem Estimating long-term treatment effects with missing data, especially monotone missing.
method The paper introduces the sequential missingness assumption for identification and proposes three novel estimation methods: inverse probability weighting, sequential regression imputation, and SeqMSM. It also introduces a balancing-enhanced approach, BalanceNet, to improve estimation accuracy.
result The proposed methods, including BalanceNet, effectively estimate long-term treatment effects with monotone missing data.
Modified Bakry-Émery criterion inequality for Tsallis entropy monotonicity.
problem Establishing improved logarithmic Sobolev inequalities and monotonicity of Tsallis entropy.
method Proving a one-parameter family of weighted Bakry-Émery Γ2 criterion inequalities and a modified inequality. result Yields a family of sharp Sobolev inequalities and monotonicity of Tsallis entropy.
Monotonic improvement in uncertainty estimation with Gaussian processes as dimension increases.
problem Uncertainty quantification in machine learning models, especially with Gaussian processes, is challenging and poorly understood.
method Analyzing the behavior of marginal likelihood and cross-validation metrics as input dimension increases, and exploring the effects of cold posteriors.
result The marginal likelihood improves monotonically with input dimension, while cross-validation metrics exhibit double descent behavior.
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…
Bayesian optimization improves Monte-Carlo tree search for better state value estimation.
problem Slow convergence in Monte-Carlo tree search due to averaging in backpropagation.
method Softmax MCTS and Monotone MCTS, using Bayesian optimization with Gaussian process prior.
result Our framework outperforms previous methods in computer Go.
Algorithm extracts non-monotonic rules from statistical models using HUIM.
problem Extracting non-monotonic rules from statistical learning models.
method Reduces problem to HUIM, uses TreeExplainer for feature importance.
result Significant improvement in classification metrics and training time.
New algorithm maximizes non-monotone adaptive submodular functions in linear time.
problem Maximizing non-monotone adaptive submodular functions subject to a cardinality constraint.
method Developed a linear-time algorithm for non-monotone adaptive submodular maximization.
result Achieved a 1/e−ε approximation ratio with O(nε−2logε−1) value oracle queries. Investigates methods to regularize quantile regression for accurate predictions.
problem Improving accuracy and fairness in quantile regression predictions.
method Various regularization techniques including expected pinball loss, monotonicity constraints, and rate constraints.
result Deep lattice networks can maintain non-crossing quantiles and improve calibration and fairness.
A new approach to group fairness treats it as a bargaining problem.
problem Fairness in deploying predictors across subpopulations.
method Interpreting fairness as a bargaining problem and proposing relative improvement.
result Relative improvement provides axiomatic justification and finite-sample convergence guarantees.
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.
This paper improves reinforcement learning policies in a scalable way.
problem Ensuring monotonic policy improvement in entropy-regularized RL.
method Derives an entropy-aware lower bound and proposes a novel RL algorithm.
result Demonstrates effectiveness in continuous-state tasks using a linear function approximator.
The paper develops a safe policy gradient algorithm for reinforcement learning.
problem Safety issues in reinforcement learning for real-world control tasks.
method Stochastic optimization perspective, meta-parameter schedules, adaptive selection of step size and batch size.
result Monotonic improvement guarantees for a wide class of parametric policies.
New algorithms reduce variance in solving complex mathematical problems.
problem Solving convex-concave saddle point problems, variational inequalities, and inclusions.
method Stochastic variance reduction for extragradient, forward-backward-forward, and forward-reflected-backward methods.
result All proposed methods converge with complexities matching or improving deterministic counterparts.
The paper improves PCS approximation for ranking and selection under limited simulation budgets.
problem Improving finite sample performance in Ranking and Selection.
method Develops a Bahadur-Rao type expansion for PCS, proposes a novel FCBA policy.
result FCBA policy achieves superior PCS performance compared to traditional methods.
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.
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.
Probit Monotone BART estimates binary outcomes using monotonic functions.
problem Estimating conditional mean functions for binary outcomes with monotonicity constraints.
method Proposes a new BART variant that incorporates monotonicity constraints for binary outcomes.
result Allows for more precise estimation of monotonic functions in binary outcome models.
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, shorter proofs for varifolds and flows with improved decay of flatness.
problem Proving regularity theorems for varifolds and flows with bounded first variation and forcing.
method Decay of flatness via weighted monotonicity formulas and viscosity approach.
result Improved proofs with decay of flatness and characterization of blow-ups.
Large GD stepsizes improve margins and speed up training for non-homogeneous networks.
problem Training efficiency and margin improvement in non-homogeneous two-layer networks.
method Investigation of two distinct phases in GD training, showing margin growth and empirical risk decrease.
result Large GD stepsizes lead to faster convergence and improved margins in non-homogeneous networks.
A key problem in reinforcement learning for control with general function approximators (such as deep neural networks and other nonlinear functions) is that, for many algorithms employed in practice, updates to the policy or Q-function may fail to improve performance---or worse, actually cause the policy performance …
Paper uses deep learning for accurate, monotonic cardinality estimation.
problem Accurate and monotonic cardinality estimation for similarity selection.
method Feature extraction to Hamming space, followed by deep learning regression.
result Demonstrates improved query optimizer performance.
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.
MonoNet enforces monotonicity to improve model interpretability.
problem Lack of interpretability in complex machine learning models.
method Enforces monotonicity between features and outputs in deep learning models.
result Enforcing monotonicity allows for better understanding of model predictions.