arXiv research

We show for an alternating knot the minimal boundary slope of an essential spanning surface is given by the signature plus twice the minimum degree of the Jones polynomial and the maximal boundary slope of an essential spanning surface is given by the signature plus twice the maximum degree of the Jones polynomial. For…

Understanding the evolution of human society, as a complex adaptive system, is a task that has been looked upon from various angles. In this paper, we simulate an agent-based model with a high enough population tractably. To do this, we characterize an entity called \textit{society}, which helps us reduce the complexit…

The class of +adequate links contains both alternating and positive links. Generalizing results of Tanaka (for the positive case) and Ng (for the alternating case), we construct fronts of an arbitrary +adequate link A so that the diagram has a ruling, therefore its Thurston-Bennequin number is maximal among Legendrian …

It is shown that there exist alternating non-Montesinos knots whose essential spanning surfaces with maximal and minimal boundary slopes are not realised by the checkerboard surfaces coming from a reduced alternating planar diagram.

Chirality affects the curvature of molecular networks, influencing their shape and stability.

The ratio of volume to crossing number of a hyperbolic knot is known to be bounded above by the volume of a regular ideal octahedron, and a similar bound is conjectured for the knot determinant per crossing. We investigate a natural question motivated by these bounds: For which knots are these ratios nearly maximal? We…

We construct a Kruskal-Szekeres-type analytic extension of the Emparan-Reall black ring, and investigate its geometry. We prove that the extension is maximal, globally hyperbolic, and unique within a natural class of extensions. The key to those results is the proof that causal geodesics are either complete, or approac…

In this article, we mathematically study several GAN related topics, including Inception score, label smoothing, gradient vanishing and the -log(D(x)) alternative. --- An advanced version is included in arXiv:1703.02000 "Activation Maximization Generative Adversarial Nets". Please refer Section 6 in 1703.02000 for deta…

New algorithm solves maximal monotone inclusion problems.

Minimal surfaces with planar curvature lines in the Euclidean space have been studied since the late 19th century. On the other hand, the classification of maximal surfaces with planar curvature lines in the Lorentz-Minkowski space has only recently been given. In this paper, we use an alternative method not only to re…

We prove that the genus of the Turaev surface of a link diagram is determined by a graph whose vertices correspond to the boundary components of the maximal alternating regions of the link diagram. Furthermore, we use these graphs to classify link diagrams whose Turaev surface has genus one or two, and we prove that si…

We describe moduli spaces of invariant generalized complex structures and moduli spaces of invariant generalized Kähler structures on maximal flag manifolds under $B$-transformations. We give an alternative description of the moduli space of generalized complex structures using pure spinors, and describe a cell decompo…

In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global optimum. In order to algorithmically solve this optimization problem, we propose tw…

msPCA solves sparse PCA for multiple components efficiently.

In this paper we establish some parabolicity criteria for maximal surfaces immersed into a Lorentzian product space of the form $M^2\times\mathbb{R}_1$, where $M^2$ is a connected Riemannian surface with non-negative Gaussian curvature and $M^2\times\mathbb{R}_1$ is endowed with the Lorentzian product metric $<,>=<,>_M…

The Turaev genus of a link can be thought of as a way of measuring how non-alternating a link is. A link is Turaev genus zero if and only if it is alternating, and in this viewpoint, links with large Turaev genus are very non-alternating. In this paper, we study Turaev genus one links, a class of links which includes a…

Study optimizes sampling to avoid extreme tail risks in unknown heavy-tailed distributions.

We present a new mixture model-based discriminant analysis approach for functional data using a specific hidden process regression model. The approach allows for fitting flexible curve-models to each class of complex-shaped curves presenting regime changes. The model parameters are learned by maximizing the observed-da…

We consider sequential decision making problems for binary classification scenario in which the learner takes an active role in repeatedly selecting samples from the action pool and receives the binary label of the selected alternatives. Our problem is motivated by applications where observations are time consuming and…

MODWST improves classification tasks with wavelet scattering.

In this paper we introduce a local approach for the study of maximal surfaces immersed into a Lorentzian product space of the form $M^2\times R_1$, where $M^2$ is a connected Riemannian surface and $M^2\times R_1$ is endowed with the product Lorentzian metric. Specifically, we establish a local integral inequality for …

Unified rigidity theorem for cyclic and alternating surfaces.

We study adversarial robustness of neural networks from a margin maximization perspective, where margins are defined as the distances from inputs to a classifier's decision boundary. Our study shows that maximizing margins can be achieved by minimizing the adversarial loss on the decision boundary at the "shortest succ…

Information-maximization clustering learns a probabilistic classifier in an unsupervised manner so that mutual information between feature vectors and cluster assignments is maximized. A notable advantage of this approach is that it only involves continuous optimization of model parameters, which is substantially easie…

User engagement in social networks depends critically on the number of online actions their users take in the network. Can we design an algorithm that finds when to incentivize users to take actions to maximize the overall activity in a social network? In this paper, we model the number of online actions over time usin…

We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin diagrams, as well as a simple classification of alternating positive braid knots.

New framework improves EM algorithm convergence under log-Sobolev inequality.

Integrates VAEs into EM for deep clustering and generation.

New method explains high-dimensional sphere data with latent factors.

We classify all knot diagrams of genus two and three, and give applications to positive, alternating and homogeneous knots, including a classification of achiral genus 2 alternating knots, slice or achiral 2-almost positive knots, a proof of the 3- and 4-move conjectures, and the calculation of the maximal hyperbolic v…

We propose an efficient algorithm for solving orthogonal canonical correlation analysis (OCCA) in the form of trace-fractional structure and orthogonal linear projections. Even though orthogonality has been widely used and proved to be a useful criterion for pattern recognition and feature extraction, existing methods …

Improved spatial prediction for massive datasets using SME model.

Bayesian graphical models are a useful tool for understanding dependence relationships among many variables, particularly in situations with external prior information. In high-dimensional settings, the space of possible graphs becomes enormous, rendering even state-of-the-art Bayesian stochastic search computationally…

We give an alternative proof of a result of Cantat and Dupont, showing that any automorphism of a K3 surface with measure of maximal entropy in the Lebesgue class must be a Kummer example. Our method exploits the existence of Ricci-flat metrics on K3s and also covers the non-projective case.

Hill-ADAM optimizes loss landscapes by exploring state space deterministically.

MACE optimizes stock portfolios for maximal predictability.

We study the canonical complexifications of non-compact Riemannian symmetric spaces G/K by the Grauert tube construction. We determine the maximal such complexification, a domain already constructed in another context by Akhiezer and Gindikin (Math. Ann., 1990), and show that this domain is Stein. We show there is an a…

Improved pre-trained embeddings through effective entropy maximization.

Alt-GNNs improve travel mode choice modeling by integrating graph neural networks with GEV models.

We present explicit geometric decompositions of the hyperbolic complements of alternating $k$-uniform tiling links, which are alternating links whose projection graphs are $k$-uniform tilings of $S^2$, $\mathbb{E}^2$, or $\mathbb{H}^2$. A consequence of this decomposition is that the volumes of spherical alternating $k…

New active learning strategy improves decision-making accuracy.

This paper introduces the hypervolume maximization with a single solution as an alternative to the mean loss minimization. The relationship between the two problems is proved through bounds on the cost function when an optimal solution to one of the problems is evaluated on the other, with a hyperparameter to control t…

The standard interpretation of importance-weighted autoencoders is that they maximize a tighter lower bound on the marginal likelihood than the standard evidence lower bound. We give an alternate interpretation of this procedure: that it optimizes the standard variational lower bound, but using a more complex distribut…

TIM maximizes mutual information for few-shot learning, outperforming state-of-the-art methods.

MINIMALIST maximizes mutual information for likelihood estimation from simulated data.

MissNODAG learns cyclic causal graphs from incomplete data.

The paper analyzes convergence properties of NGA and PAMe for $L_1$-norm PCA.

Consider the optimal dividend problem for an insurance company whose uncontrolled surplus precess evolves as a spectrally negative Levy process. We assume that dividends are paid to the shareholders according to admissible strategies whose dividend rate is bounded by a constant. The objective is to find a dividend poli…