Study derives new equation for reserves in non-monotone information scenarios.
problem Modeling reserves in situations where information is not always increasing.
method Infinitesimal approach to derive generalized stochastic Thiele equation.
result New equation allows for information discarding and solves open problems.
Extends martingale theory to non-monotone information in jump processes.
problem Non-monotone information dynamics in financial and insurance applications.
method Develops a general theory of martingale representations for non-monotone filtrations.
result Introduces a symmetric counterpart to martingale representations that quantifies information loss.
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.
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.
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.
Develops a new geometric framework for quantum metrics.
problem Quantum metric generalization for pure two-qubit states.
method Support-projected Petz monotone geometry for pure two-qubit families.
result Strictly generalizes SLD/Bures case and includes other metrics.
New method speeds up model selection for complex scientific tasks.
problem Exhaustive model selection is computationally infeasible for large model spaces.
method Branch-and-bound algorithm with non-monotonic criteria.
result Guaranteed identification of optimal models with significant computational speedups.
Researchers propose a non-monotone quantum natural gradient for quantum systems.
problem Applying natural gradient methods to quantum systems without monotonicity.
method Introducing a non-monotone quantum natural gradient (QNG) and demonstrating its superiority over conventional QNG.
result Non-monotone QNG outperforms conventional QNG in terms of convergence speed.
This paper introduces a nonparametric copula-based index for detecting the strength and monotonicity structure of linear and nonlinear statistical dependence between pairs of random variables or stochastic signals. Our index, termed Copula Index for Detecting Dependence and Monotonicity (CIM), satisfies several desirab…
Develops methods to select informative conformal prediction sets with FCR control.
problem Selecting informative prediction sets with FCR control in supervised learning.
method Unified framework for informative conformal prediction sets with FCR control.
result First procedures providing FCR control for informative prediction sets.
QMIX combines per-agent values to create decentralised policies.
problem Training decentralised policies from centralised learning.
method QMIX uses a mixing network to estimate joint action-values as a monotonic combination of per-agent values.
result QMIX significantly outperforms existing methods on the StarCraft Multi-Agent Challenge (SMAC).
Robots gather information resiliently despite failures and attacks.
problem Resilient information gathering in adversarial or failure-prone environments.
method First scalable algorithm for minimal communication, system-wide resiliency, and provable approximation performance.
result Algorithm ensures optimal or near-optimal solutions for any number of failures and attacks.
Modeling default contagion with partial information and optimal interventions.
problem Analyzing default contagion in financial networks with limited regulator information.
method Developed analytical models for optimal intervention policies and contagion magnitude, extending previous work.
result Optimal intervention policies are 'monotonic' in terms of intervention cost, closeness to invulnerability, and connectivity.
The consultative papers for the Basel II Accord require rating systems to provide a ranking of obligors in the sense that the rating categories indicate the creditworthiness in terms of default probabilities. As a consequence, the default probabilities ought to present a monotonous function of the ordered rating catego…
Learning new tasks with few samples using related task evaluations.
problem Learning a new task with limited data and related task evaluations.
method Modeling task relatedness through weak monotonicity and leveraging it in transfer learning and model selection aggregation.
result Pruning the model class based on monotonicity and hedging on the task frontier.
We show that, in finite dimensions, the only monotone metrics for which the (+1) and (-1) affine connections are mutually dual are constant multiples of Bogoliubov-Kubo-Mori metric
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.
Study quantifies information flow in neural networks using relative entropy and RG analogy.
problem Quantifying information flow in deep neural networks.
method Explicit computation of relative entropy in Ising models and feedforward neural networks.
result Monotonic increase of relative entropy to an asymptotic value, confirming connection to c-theorem.
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.
We present results on simulations of a stock market with heterogeneous, cumulative information setup. We find a non-monotonic behaviour of traders' returns as a function of their information level. Particularly, the average informed agents underperform random traders; only the most informed agents are able to beat the …
QMIX combines local values to train decentralised policies in a centralised setting.
problem Training decentralised policies in a centralised, end-to-end fashion.
method QMIX estimates joint action-values as a combination of per-agent values conditioned on local observations, enforcing monotonicity.
result QMIX significantly outperforms existing methods on StarCraft II tasks.
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.
QR-MIX models joint state-action values as a distribution to handle randomness in MARL.
problem Randomness in rewards and observations leads to randomness in long-term returns in MARL.
method QR-MIX uses quantile regression and combines it with QMIX and IQN to model joint state-action values as a distribution.
result QR-MIX outperforms QMIX in the StarCraft Multi-Agent Challenge (SMAC) environment.
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.
The study examines when large trades are considered news or liquidity shocks in a market model.
problem Understanding when large trades are news or liquidity shocks in a market model.
method A sequential competitive limit order book model with asymmetric information and Student-t tails for liquidity demand.
result Heavy-tailed liquidity demand flattens and concavifies price impact, delaying price discovery.
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.
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.
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.
Improved bounds on the copula of a bivariate random vector are computed when partial information is available, such as the values of the copula on a given subset of [ 0 , 1 ] 2 [0,1]^2 [ 0 , 1 ] 2 , or the value of a functional of the copula, monotone with respect to the concordance order. These results are then used to compute model-free bo…
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.
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 ε.
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.
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…
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.
Proposes a method to incorporate hunches in experimental design for faster convergence.
problem Expensive experiments and expert hunches in experimental design.
method Two-stage Gaussian process modeling with monotonicity information.
result Faster convergence in experimental design problems.
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 present an experimental and simulated model of a multi-agent stock market driven by a double auction order matching mechanism. Studying the effect of cumulative information on the performance of traders, we find a non monotonic relationship of net returns of traders as a function of information levels, both in the e…
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.
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…
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.
Optimizes Q-learning for MDPs with linear features, achieving sample efficiency.
problem Finding optimal policies in large-scale MDPs with limited samples.
method Parametric Q-learning with linearly additive features, exploiting monotonicity and noise structure.
result Proves sample optimality with O ~ ( K / ε 2 ( 1 − γ ) 3 ) \widetilde{O}(K/ε^2(1-γ)^3) O ( K / ε 2 ( 1 − γ ) 3 ) samples for ε ε ε -optimality. The paper explores how regularization can lead to convergence in imperfect information games.
problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.