arXiv research

Study of complex Hessian equations using subharmonic functions and geodesics.

Paper studies unique interior points and estimates for generalized translating soliton problems.

Suppose $f(x,y) + \fracκ{2} \|x\|^2 - \fracσ{2}\|y\|^2$ is convex where $σ>0$, and the argmin function $γ(x) = \{ γ: \inf_y f(x,y) = f(x,γ)\}$ exists and is single valued. We will prove $γ$ is differentiable almost everywhere. As an application we deduce a minimum principle for certain semiconcave subsolutions.

Exponential models of distributions are widely used in machine learning for classiffication and modelling. It is well known that they can be interpreted as maximum entropy models under empirical expectation constraints. In this work, we argue that for classiffication tasks, mutual information is a more suitable informa…

This paper provides a geometrical derivation of the Hybrid Minimum Principle (HMP) for autonomous hybrid systems whose state manifolds constitute Lie groups $(G,\star)$ which are left invariant under the controlled dynamics of the system, and whose switching manifolds are defined as smooth embedded time invariant subma…

We analyze differences between two information-theoretically motivated approaches to statistical inference and model selection: the Minimum Description Length (MDL) principle, and the Minimum Message Length (MML) principle. Based on this analysis, we present two revised versions of MML: a pointwise estimator which give…

The Ekeland variational principle implies what can be regarded as a strong version, in the $C^1$ category, of the Yau minimum principle: under the appropriate hypotheses {\it every} minimizing sequence admits a {\it good shadow}, a second minimizing sequence that has good properties and is asymptotic to the original on…

A new strategy selects k in k-NN regression without hold-out data.

The economic life of an asset is the optimum length of its usefulness, which is the moment that the asset's expenses are minimum. In this paper, the economic life of physical assets, such as industry machine and equipment, can be interpreted as the moment that the minimum is reached by its equivalent property cost func…

PCA (Principal Component Analysis) and its variants areubiquitous techniques for matrix dimension reduction and reduced-dimensionlatent-factor extraction. One significant challenge in using PCA, is thechoice of the number of principal components. The information-theoreticMDL (Minimum Description Length) principle gives…

Paper proposes deep neural networks for nonparametric regression from dependent data.

Minimum attention improves reinforcement learning performance in high-dimensional dynamics.

Optimizes control of infectious disease spread using stochastic methods.

We tackle the problem of penalty selection of regularization on the basis of the minimum description length (MDL) principle. In particular, we consider that the design space of the penalty function is high-dimensional. In this situation, the luckiness-normalized-maximum-likelihood(LNML)-minimization approach is favorab…

Time-invariant linear dynamical system arises in many real-world applications,and its usefulness is widely acknowledged. A practical limitation with this model is that its latent dimension that has a large impact on the model capability needs to be manually specified. It can be demonstrated that a lower-order model cla…

Study on maximum principles for nonlinear equations on Riemannian manifolds.

Study shows LLC correlates with neural network compressibility.

A new method avoids overfitting in network reconstruction by using the minimum description length principle.

New proof given for a functional's minimum condition.

In this paper, we use the distance comparison principle, first been developed by G. Huisken, to study the spatial curve shortening flow. We have got the result that if the initial curve is the helix, then the local minimum of the ratio of the extrinsic and intrinsic distance is non-decreasing. And we have proved a Gray…

Bayesian methods detect clusters in noisy data more reliably.

Market strategies minimize Fisher information to minimize risk.

The minimum description length (MDL) principle in supervised learning is studied. One of the most important theories for the MDL principle is Barron and Cover's theory (BC theory), which gives a mathematical justification of the MDL principle. The original BC theory, however, can be applied to supervised learning only …

Optimizes minimum-volume prediction sets for multivariate regression.

New architectures improve KANs, making them more interpretable and accurate.

Robust low-rank matrix estimation is a topic of increasing interest, with promising applications in a variety of fields, from computer vision to data mining and recommender systems. Recent theoretical results establish the ability of such data models to recover the true underlying low-rank matrix when a large portion o…

In this paper, we develop a new mathematical technique which allows us to express the joint distribution of a Markov process and its running maximum (or minimum) through the marginal distribution of the process itself. This technique is an extension of the classical reflection principle for Brownian motion, and it is o…

MC-MCL improves MCL for nonlinear clustering.

The paper explores how over-parameterized linear regression models generalize without violating learning theory principles.

Non-negative matrix factorization (NMF) is a dimensionality reduction technique which tends to produce a sparse representation of data. Commonly, the error between the actual and recreated matrices is used as an objective function, but this method may not produce the type of representation we desire as it allows for th…

The Fisher information approximation (FIA) is an implementation of the minimum description length principle for model selection. Unlike information criteria such as AIC or BIC, it has the advantage of taking the functional form of a model into account. Unfortunately, FIA can be misleading in finite samples, resulting i…

Defines MER for Bayesian learning, a gap between achievable and optimal performance.

New proof shows how to identify DAGs with weakly increasing errors.

We consider the problem of estimating undirected triangle-free graphs of high dimensional distributions. Triangle-free graphs form a rich graph family which allows arbitrary loopy structures but 3-cliques. For inferential tractability, we propose a graphical Fermat's principle to regularize the distribution family. Suc…

During the past few years Boolean matrix factorization (BMF) has become an important direction in data analysis. The minimum description length principle (MDL) was successfully adapted in BMF for the model order selection. Nevertheless, a BMF algorithm performing good results from the standpoint of standard measures in…

This paper extends the work in [Suzuki, 1996] and presents an efficient depth-first branch-and-bound algorithm for learning Bayesian network structures, based on the minimum description length (MDL) principle, for a given (consistent) variable ordering. The algorithm exhaustively searches through all network structures…

A central problem in analyzing networks is partitioning them into modules or communities. One of the best tools for this is the stochastic block model, which clusters vertices into blocks with statistically homogeneous pattern of links. Despite its flexibility and popularity, there has been a lack of principled statist…

Kernel networks' stability edge linked to Fisher Information singularity.

A new principle minimizes residual and introduces momentum to improve PDE solution dynamics.

Paper proposes a method for early stopping in regression using reproducing kernels.

The minimum message length principle is an information theoretic criterion that links data compression with statistical inference. This paper studies the strict minimum message length (SMML) estimator for $d$-dimensional exponential families with continuous sufficient statistics, for all $d \ge 1$. The partition of an …

A large collection of financial contracts offering guaranteed minimum benefits are often posed as control problems, in which at any point in the solution domain, a control is able to take any one of an uncountable number of values from the admissible set. Often, such contracts specify that the holder exert control at a…

Machine Learning algorithms are typically regarded as appropriate optimization schemes for minimizing risk functions that are constructed on the training set, which conveys statistical flavor to the corresponding learning problem. When the focus is shifted on perception, which is inherently interwound with time, recent…

In this paper, based on the local comparison principle in [12], we study the local behavior of the difference of two spacelike graphs in a neighborhood of a second contact point. Then we apply it to the constant mean curvature equation in 3-dimensional Lorentz-Minkowski space $\mathbb{L}^3$ and get the uniqueness of cr…

We solve the paradox of score-based methods by minimizing path variance.

This paper improves indoor positioning accuracy by deploying reference nodes to ensure Line-of-Sight.

Two environments are enough to infer causal graphs and counterfactuals.

Fast, fully-automated histograms for large data sets.