FLOWGEM generates complete datasets from incomplete data with non-monotone MAR missingness.
problem Dealing with non-monotone Missing at Random (MAR) missingness in data.
method Iterative particle evolution of Wasserstein Gradient Flow, approximated by local linear estimators of density ratio.
result FLOWGEM achieves state-of-the-art performance across various settings, including non-monotone MAR mechanisms.
New optimizer MARS-M combines variance reduction with Muon for faster LLM training.
problem Training large-scale neural networks efficiently.
method Integrates MARS variance reduction with Muon optimizer.
result MARS-M converges to a first-order stationary point at a rate of i l d e O ( T − 1 / 3 ) ilde{\mathcal{O}}(T^{-1/3}) i l d e O ( T − 1/3 ) . Improves MARS for nonparametric multivariate regression with dimension reduction.
problem High number of basis functions in MARS for high-order interactions.
method Linear combinations of covariates for dimension reduction, facilitating gradient calculation and eigen-analysis for estimation.
result Asymptotic theory and numerical studies show improved performance over MARS.
Proposes a lasso variant of MARS for nonparametric regression.
problem Nonparametric regression with MARS.
method Least squares estimation over convex function combinations with a complexity constraint.
result Achieves logarithmic convergence rate in dimensionality.
MarS simulates financial markets using generative models.
problem Simulating realistic financial market effects.
method Order-level generative foundation model (LMM) for realistic, interactive, and controllable order generation.
result Strong scalability and robust realism in MarS.
MARS optimizes large model training by reducing variance, outperforming AdamW.
problem Training large models efficiently and scalably.
method Unified optimization framework MARS combining preconditioned gradient updates and variance reduction.
result MARS outperforms AdamW in training GPT-2 models.
Novel estimation methods improve MAR model accuracy for high-dimensional time series.
problem Limited estimation techniques for Matrix Autoregressive (MAR) models.
method Adapted Yule-Walker equations and Burg's method.
result Proposed methods achieve comparable model fit to VAR models.
MARS model outperforms others in stock price prediction across sectors.
problem Developing accurate models for stock price prediction.
method Used time series, econometric, machine learning, and deep learning models on stock data.
result MARS model is the best performing model across IT, Banking, and Health sectors.
SMART combines decision trees and MARS for better regression modeling.
problem High variance in decision trees for continuous relationships, poor performance in MARS for discontinuities.
method SMART uses a decision tree to identify subsets with distinct continuous relationships, then applies MARS to fit these relationships independently.
result SMART improves regression performance over state-of-the-art methods in capturing discontinuities and continuous relationships.
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.
MARS-Gym framework for marketplaces to train and evaluate recommender systems.
problem Challenges in designing, training, and evaluating recommender systems in marketplaces.
method Open-source framework for Reinforcement Learning agents in marketplaces.
result Empowers researchers and engineers to quickly build and evaluate agents for recommendations.
Latent Variable Models (LVMs) are a large family of machine learning models providing a principled and effective way to extract underlying patterns, structure and knowledge from observed data. Due to the dramatic growth of volume and complexity of data, several new challenges have emerged and cannot be effectively addr…
MARS automatically selects tensor decomposition ranks, improving performance in neural network tasks.
problem Determining optimal decomposition ranks in tensor decompositions.
method MARS uses binary masks to learn optimal tensor structure during training via relaxed MAP estimation.
result MARS achieves better results than previous methods in various tasks.
Optimizes variational autoencoder for detecting missing data in Mars rover transmissions.
problem Detecting missing data in Mars rover transmissions to prevent volume loss and corruption.
method Applies derivative-free optimization to tune variational autoencoder.
result Improves variational autoencoder's ability to detect missing data, aiding GDSA team.
A hierarchical Bayesian classifier is trained at pixel scale with spectral data from the CRISM (Compact Reconnaissance Imaging Spectrometer for Mars) imagery. Its utility in detecting rare phases is demonstrated with new geologic discoveries near the Mars-2020 rover landing site. Akaganeite is found in sediments on the…
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.
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.
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.
Paper proposes a new MAR model for global economic forecasting.
problem Joint modeling of economic and financial variables across countries.
method Sparse matrix autoregressive model with trade network integration.
result Sparse component differentiates systematic and idiosyncratic cross-predictability.
Improved flow-based models capture dependencies better with multi-scale autoregressive priors.
problem Limited expressiveness of flow-based models for long-range data dependencies.
method Introducing channel-wise dependencies through multi-scale autoregressive priors (mAR) in split coupling flow layers (mAR-SCF).
result Achieves state-of-the-art density estimation results on MNIST, CIFAR-10, and ImageNet.
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.
A reinforcement learning framework for Mars rover control using temporal logic.
problem Sparse rewards in continuous-state continuous-action MDPs with high-level temporal structures.
method Actor-critic, model-free, online RL framework with modular DDPG architecture.
result Success rate of synthesised policy in Mars rover experiment.
Study learns a neuron with non-monotonic activation functions.
problem Learning a single neuron with non-monotonic activation functions.
method Gradient descent (GD) with conditions on activation function and input distribution.
result Learnability of non-monotonic activation functions is established without monotonicity assumption.
A new unsupervised method removes CT metal artifacts using beta-CycleGAN and attention.
problem Metal artifact reduction in computed tomography (CT) images.
method Unsupervised learning using a beta-CycleGAN architecture with attention mechanism.
result Improved metal artifact removal that preserves image details.
Study shows rigidity for entropy minimizers in non-monotone cases.
problem Rigidity of entropy minimizers in non-monotone settings.
method Elementary proofs in non-monotone situations.
result Showed rigidity for minimizers of generalized Colding-Minicozzi entropies.
Diminishing-returns (DR) submodular optimization is an important field with many real-world applications in machine learning, economics and communication systems. It captures a subclass of non-convex optimization that provides both practical and theoretical guarantees. In this paper, we study the fundamental problem of…
The explosion of time series data in recent years has brought a flourish of new time series analysis methods, for forecasting, clustering, classification and other tasks. The evaluation of these new methods requires either collecting or simulating a diverse set of time series benchmarking data to enable reliable compar…
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 . The information dynamics in finance and insurance applications is usually modeled by a filtration. This paper looks at situations where information restrictions apply such that the information dynamics may become non-monotone. A fundamental tool for calculating and managing risks in finance and insurance are martingale…
In this work we construct Calabi quasi-morphisms on the universal cover of the group Ham(M) of Hamiltonian diffeomorphisms for some non-monotone symplectic manifolds. This complements a result by Entov and Polterovich which applies in the monotone case. Moreover, in contrast to their work, we show that these quasi-morp…
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.
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 − ε 1/e-ε 1/ e − ε approximation ratio with O ( n ε − 2 log ε − 1 ) O(nε^{-2}\log ε^{-1}) O ( n ε − 2 log ε − 1 ) value oracle queries. A Closer Look at Disentangling in β-VAE shows non-monotonic inference performance.
problem Learning disentangled representations from data.
method Generalization of VAE using variational inference with hyperparameter β.
result Non-monotonic inference performance in β-VAE with a finite optimal β.
New approach optimizes expensive black-box systems with uncertain outputs.
problem Optimizing expensive black-box systems with limited data and uncertainty.
method Flexible non-interpolating surrogate model (TK-MARS) and Smart-Replication approach.
result TK-MARS outperforms original MARS and detects important variables.
Paper tackles non-monotonic resource utilization in sequential decision-making.
problem Sequential decision-making under uncertainty with resource constraints.
method Introduces a new MDP policy with constant regret against LP relaxation.
result Develops a learning algorithm with logarithmic regret for unknown outcome distributions.
A probabilistic query may not be estimable from observed data corrupted by missing values if the data are not missing at random (MAR). It is therefore of theoretical interest and practical importance to determine in principle whether a probabilistic query is estimable from missing data or not when the data are not MAR.…
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.
A mathematical analysis of the distribution of voting power in the Council of the European Union operating according to the Treaty of Lisbon is presented. We study the effects of Brexit on the voting power of the remaining members, measured by the Penrose--Banzhaf Index. We note that the effects in question are non-mon…
Proves uniqueness of non-extremal Kerr-Newman black holes under small perturbations.
problem Uniqueness of non-extremal Kerr-Newman black holes under small perturbations.
method Perturbative analysis using Mars-Simon type tensors.
result Proves that a space-time close to the Kerr-Newman family must be one of the Kerr-Newman solutions.
The paper extends ERP framework to non-monotonic payoffs and short selling bans.
problem Valuation of contingent claims with short selling bans under ERP framework.
method Unified framework for ERP pricing, extending to non-monotonic payoffs, and comparing with Black-Scholes.
result Equal-risk prices differ from Black-Scholes prices under short selling bans.
Study on MMV in jump-diffusion models resolves MV's non-monotonicity issues.
problem Non-monotonicity and free cash flow stream problems in MV preferences.
method Explicit solution for MMV preferences in jump-diffusion models, proving non-negative potential measures.
result MMV resolves MV's non-monotonicity and free cash flow stream issues.
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.
Paper tackles online DR-submodular maximization with various convex sets.
problem Maximizing DR-submodular functions online over different convex sets.
method Develops online algorithms with approximation guarantees for various convex sets.
result Achieves 1 / e 1/e 1/ e -approximation ratio with O ( T 2 / 3 ) O(T^{2/3}) O ( T 2/3 ) regret for down-closed sets. 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.
We propose non-stationary spectral kernels for Gaussian process regression. We propose to model the spectral density of a non-stationary kernel function as a mixture of input-dependent Gaussian process frequency density surfaces. We solve the generalised Fourier transform with such a model, and present a family of non-…
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.
New approach to meaningful and robust algorithmic recourse.
problem Ineffective and unmeaningful algorithmic recourse explanations.
method Meaningful Algorithmic Recourse (MAR) and Effective Algorithmic Recourse (EAR).
result Proposes new constraints for algorithmic recourse that improve both prediction and target.
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.