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 analysis of annealing paths in sampling and estimation.
problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.
Study on identifying AMP chain graph models under known and unknown component decompositions.
problem Identifying AMP chain graph models with known and unknown chain component decompositions.
method Analyzes conditions for identifiability of AMP models and proposes algorithms for structure recovery.
result Conditions for DAG identifiability in AMP models extend equal variance criteria for Bayes nets.
Deep networks can efficiently represent low-dimensional manifolds.
problem Representing data on low-dimensional manifolds in high-dimensional spaces.
method Deep neural networks, specifically the first two layers, can embed points on monotonic chains and more general manifolds with minimal error.
result Deep networks can embed points on low-dimensional manifolds with an almost optimal number of parameters and low error.
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.
New insights into stochastic methods for solving variational inequalities.
problem Understanding convergence behaviors of stochastic algorithms in variational inequalities.
method Re-casting SEG/SGDA as Markov Chains to analyze their probabilistic structures.
result The average iterate is asymptotically normal with a unique invariant distribution for various VIPs.
Monotonicity of normalized implied-volatility coordinates under no-arbitrage
problem Monotonicity of normalized implied-volatility coordinates under no-arbitrage
method Elementary discrete no-arbitrage proof
result Monotonicity principle extended to Bachelier implied volatility
Optimizes surface area for 2D flat chains in curved spaces.
problem Finding optimal surface area for 2D flat chains in curved spaces.
method Weak mean curvature flow, elliptic regularisation, almost monotonicity, Willmore energy.
result Optimal isoperimetric inequality for area minimising surfaces in curved spaces.
We present a fully nonparametric method to estimate the value function, via simulation, in the context of expected infinite-horizon discounted rewards for Markov chains. Estimating such value functions plays an important role in approximate dynamic programming and applied probability in general. We incorporate "soft in…
GAttNHP predicts future events in temporal knowledge graphs by encoding long-range dependencies and handling mutual excitation.
problem Forecasting future events in temporal knowledge graphs due to long-range dependencies, mutual excitation, and heavy-tailed inter-arrival times.
method GAttNHP uses a self-attention encoder, semantic soft-grouping, and NCQ regression to address these issues.
result GAttNHP improves entity and time prediction on six benchmark TKG datasets compared to state-of-the-art baselines.
Stein variational gradient descent improves inference in Gaussian process models.
problem Inference in Gaussian process models with non-Gaussian likelihoods and large data volumes is computationally intensive and inaccurate with traditional methods.
method Stein variational gradient descent (SVGD) for non-parametric inference.
result SVGD monotonically decreases the Kullback-Leibler divergence from the sampling distribution to the true posterior.
We propose a new framework for how to use sequential Monte Carlo (SMC) algorithms for inference in probabilistic graphical models (PGM). Via a sequential decomposition of the PGM we find a sequence of auxiliary distributions defined on a monotonically increasing sequence of probability spaces. By targeting these auxili…
MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution.
problem Understanding the coarse-graining procedure in MLP residual networks
method Analyzing a pure MLP residual stack on synthetic Markov chain sequences
result MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution
This paper approximates Gaussian process emulators with constraints and noisy data.
problem Realistic stochastic emulators with inequality constraints and noisy observations.
method Monte Carlo and Markov Chain Monte Carlo methods with noise term.
result Improved performance of MC and MCMC samplers with noisy observations and constraints.
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.
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.
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.
Let M be a weakly monotone symplectic manifold, and H be a time-dependent Hamiltonian; we assume that the periodic orbits of the corresponding time-dependent Hamiltonian vector field are non-degenerate. We construct a refined version of the Floer chain complex associated to these data and any regular covering of M, and…
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.
Detects corruption in agentic models during execution.
problem Inconsistent context, retrieval errors, or adversarial inputs corrupt intermediate steps of reasoning chains.
method Analyzes token graphs induced by attention and computes spectral statistics to emit accept/reject signals.
result A single threshold on the high frequency energy ratio optimally detects context inconsistency in agentic models.
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.
Study examines explainable machine learning for monotonic models, finding Integrated gradients better for strong monotonicity.
problem Applying explainable machine learning to science-informed models.
method Proposed axioms for monotonicity, tested Shapley value and Integrated gradients methods.
result Integrated gradients provides better explanations for strong monotonicity.
Paper proposes monotonous NMF to handle scale and ordering ambiguities in nonnegative matrix factorization.
problem Scale and ordering ambiguities in nonnegative matrix factorization.
method Alternating least-squares algorithm for monotonous NMF, relaxed mixing matrix assumption.
result Monotonous NMF estimates monotonous signals better than standard NMF when sources are monotonous.
Proves local monotonicity for Yang-Mills-Higgs flow on bundles.
problem Ensuring monotonicity for Yang-Mills-Higgs flow solutions.
method Proved a local monotonicity formula for G-bundles over Rn (n>4). result Monotone quantity matches existing formulas for Yang-Mills and Yang-Mills-Higgs flows.
Extends Gaussian process approach to handle linear inequality constraints.
problem Real-world problems with inequality constraints.
method Finite-dimensional Gaussian approach with linear inequality constraints, MCMC techniques.
result Efficient results on data fitting and uncertainty quantification.
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 ε.
Formula proves monotonicity for anisotropic minimal hypersurfaces.
problem Understanding anisotropic minimal hypersurfaces.
method Proved a monotonicity formula under a sign assumption on the Minkowski norm.
result Monotonicity formula for anisotropic minimal hypersurfaces.
New example of manifolds with monotonic heat kernels found.
problem Understanding monotonicity of heat kernels on manifolds.
method Analyzing new examples and classifying flat tori.
result Generic metrics fail monotonicity at large times.
Proposes a Bayesian nonparametric model for monotonic functions.
problem Imposing monotonicity constraints in Bayesian nonparametric models.
method Numerical solutions of stochastic differential equations for nonparametric model of monotonic functions.
result Demonstrates competitive results on benchmark functions and utility in temporal alignment of time-series data.
New maps for large-scale geometry factorize into monotone and light.
problem Large-scale analogues of topological monotone and light maps.
method Introducing coarsely monotone and coarsely light maps, showing factorization system, and proving stability.
result Coarsely monotone maps are stable under pullbacks in the coarse category.
In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all translated coordinate cones in R^n. In this paper we develop this theory further by d…
Deep lattice networks enforce monotonicity in predictions.
problem Enforcing monotonicity in deep learning models.
method Alternating linear embeddings, lattices, and calibrators with monotonicity constraints.
result Six-layer monotonic deep lattice networks outperform state-of-the-art models.
Bayesian optimization with monotonicity improves hyperparameter tuning efficiency.
problem Optimizing machine learning hyperparameters using validation error as a function of hyperparameters.
method Adapting Bayesian optimization to incorporate monotonicity constraints.
result Improvement in optimization efficiency for machine learning hyperparameter tuning.
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.
We prove three new monotonicity formulas for manifolds with a lower Ricci curvature bound and show that they are connected to rate of convergence to tangent cones. In fact, we show that the derivative of each of these three monotone quantities is bounded from below in terms of the Gromov-Hausdorff distance to the neare…
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.
Unified proof of monotonicity for p-harmonic forms and connections.
problem Monotonicity properties of p-harmonic vector bundle-valued k-forms.
method Study of energy-momentum tensor and adaptation to Yang-Mills-Higgs pairs.
result Unified monotonicity formula for p-harmonic maps, Yang-Mills connections, and p-Yang-Mills connections.
Proves monotonicity of parabolic frequency on all manifolds without curvature assumptions.
problem Monotonicity of parabolic frequency on manifolds.
method Analyzes parabolic frequency function on manifolds, proving monotonicity without curvature assumptions.
result Monotonicity of parabolic frequency on all manifolds, no curvature assumption needed.
Paper introduces algorithms for explaining monotonic classifiers.
problem Need for explanations of monotonic classifiers.
method Polynomial algorithms for formal explanations of monotonic classifiers.
result Efficient model-agnostic algorithm for enumerating explanations.
Develops monotone tree-based GAMI models using XGBoost.
problem Incorporating monotonicity into GAMI models based on boosted trees.
method Adapting XGBoost algorithm to fit monotone GAMI-Tree models, filtering interactions, and parsing results.
result Fits monotone GAMI-Tree models that are directly interpretable and visualizable.
The paper evaluates the importance of monotonicity in AI fairness across various fields.
problem Ensuring fairness in AI applications across criminology, education, health care, and finance.
method Theoretical reasoning, simulation, and extensive empirical analysis of monotonic neural additive models (MNAMs).
result Monotonicity is essential for fairness in AI ethics and society, especially in criminology, education, health care, and finance.
Study on monotonicity in CDO term structure models using Lévy processes.
problem Existence of arbitrage-free and monotone CDO term structure models.
method Conditions for positivity and monotonicity of Heath-Jarrow-Morton-Musiela equation formulated using Milian type result and regularity results for Sobolev space.
result Characterization of arbitrage-free and monotone models in terms of volatility and driving Lévy process characteristics.
New monotone Sharpe ratio measures investment performance.
problem Investment performance measurement.
method Introducing a new monotone Sharpe ratio and studying its properties.
result Established a connection with coherent risk measures and obtained an efficient representation.
Study on biharmonic map heat flow with monotonicity formula.
problem Properties of biharmonic heat kernel and extrinsic biharmonic map heat flow.
method Derived an entropy type quantity exhibiting monotonicity behaviors.
result Monotonicity formula for extrinsic biharmonic map heat flow.
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.
Study on monotone orbifold Hurwitz numbers, extending previous research.
problem Counting branched covers with specific ramification and cycle structures.
method Developed a cut-and-join recursion, quantum curve, and topological recursion conjecture.
result Explicit conjecture linking monotone orbifold Hurwitz numbers to topological recursion.
The paper proves conditions for converting homotopies to monotone homotopies in Riemannian discs and spheres.
problem Conditions for converting homotopies to monotone homotopies in Riemannian discs and spheres.
method Analyzing the boundary of Riemannian discs and spheres to determine if they can be contracted monotonously.
result A monotone homotopy can be constructed for a Riemannian disc and sphere under certain length constraints.
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.