Max flow/min cut theorem extended to currents and topology.
problem Continuous max flow/min cut theorem for complex domains.
method Continuous analogue of max flow/min cut theorem considering topology.
result Continuous max flow/min cut theorem proven for currents and laminations.
New method reduces errors in causal discovery from data.
problem Errors in causal discovery from limited data.
method Hierarchical wrapper for constraint-based algorithms.
result Significantly fewer tests, more accurate graphs, shorter run-times.
Min-cut clustering, based on minimizing one of two heuristic cost-functions proposed by Shi and Malik, has spawned tremendous research, both analytic and algorithmic, in the graph partitioning and image segmentation communities over the last decade. It is however unclear if these heuristics can be derived from a more g…
We show how 'test' vector fields may be used to give lower bounds for the Cheeger constant of a Euclidean domain (or Riemannian manifold with boundary), and hence for the lowest eigenvalue of the Dirichlet Laplacian on the domain. Also, we show that a continuous version of the classical Max Flow Min Cut Theorem for net…
We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of holographic entanglement entropies. We also prove various properties of the max flow…
Proves a generalized isoperimetric inequality for spheres in dimensions 4 and above.
problem Proving a generalized isoperimetric inequality for spheres in dimensions 4 and above.
method Reduced to a theorem about thick embeddings of graphs, proved using Kolmogorov-Barzdin theorem and max-flow min-cut theorem. Counterexample in dimension 3 uses coarea inequality and winding number computation.
result A generalized isoperimetric inequality for spheres in dimensions 4 and above.
We propose a faster and more accurate method for learning classification trees.
problem Learning optimal binary classification trees is challenging and slow.
method We introduce a stronger MIP formulation and Benders' decomposition method.
result Our method is 50 times faster and improves out-of-sample performance.
Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on "Min-Cut"-style criteria, compress both the vertices and edges of the graph into the communities, that lead to a loss of directed edge information. O…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This gives a relative version of Stallings' Theorem on the structure of groups with mo…
The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, …
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair s,t where each of s,t is either a vertex or an end in the original network. A Max-Flow Min-Cut Theorem is proved for any net…
The closed string field theory minimal-area problem asks for the conformal metric of least area on a Riemann surface with the condition that all non-contractible closed curves have length at least 2π. This is an extremal length problem in conformal geometry as well as a problem in systolic geometry. We consider the ana…
McCullagh and Yang (2006) suggest a family of classification algorithms based on Cox processes. We further investigate the log Gaussian variant which has a number of appealing properties. Conditioned on the covariates, the distribution over labels is given by a type of conditional Markov random field. In the supervised…
Mapper merges GNNs with TDA for graph visualisation.
problem Visualising complex graphs for understanding model structure.
method Combining Mapper, GNNs, and PageRank for graph pooling.
result Hierarchical visualisations reveal graph structure and model application.
Study disproves a generalized numerical criterion for certain pairs.
problem Generalized numerical criterion for pairs
method Provided counterexamples
result Negative answer to the generalized numerical criterion problem
New polynomial criterion for periodic knots identified.
problem Identifying periodic knots efficiently.
method Examined HOMFLY-PT and Kauffman polynomials of periodic links.
result Criterion is stronger than existing methods.
Positive configurations of points in the affine building were introduced in \cite{Le} as the basic object needed to define higher laminations. We start by giving a self-contained, elementary definition of positive configurations of points in the affine building and their basic properties. Then we study the geometry of …
New algorithms optimize a soft-robust criterion in reinforcement learning, reducing conservatism.
problem Computing robust policies for high-stakes decisions with limited data.
method Soft-robust criterion using risk measures, two algorithms for optimization.
result Our algorithms produce less conservative solutions than existing methods.
We introduce a new criterion to determine the order of an autoregressive model fitted to time series data. It has the benefits of the two well-known model selection techniques, the Akaike information criterion and the Bayesian information criterion. When the data is generated from a finite order autoregression, the Bay…
New framework analyzes effectiveness of neural network-based combinatorial problem solvers.
problem Analyzing neural network-based methods for combinatorial optimization problems.
method Introducing a theoretical framework to assess the effectiveness of solution-samplers using policy-gradient methods.
result Positive theoretical answer to the existence of expressive, tractable, and benign optimization landscapes for combinatorial problems.
Modified Bakry-Émery criterion inequality for Tsallis entropy monotonicity.
problem Establishing improved logarithmic Sobolev inequalities and monotonicity of Tsallis entropy.
method Proving a one-parameter family of weighted Bakry-Émery Γ2 criterion inequalities and a modified inequality. result Yields a family of sharp Sobolev inequalities and monotonicity of Tsallis entropy.
A widely applicable Bayesian information criterion (Watanabe, 2013) is applicable for both regular and singular models in the model selection problem. This criterion tends to overestimate the log marginal likelihood. We identify an overestimating term of a widely applicable Bayesian information criterion. Adjustment of…
New criterion improves predictive evaluation in weighted inference scenarios.
problem Improving predictive evaluation in scenarios with different likelihoods for estimation and evaluation.
method Developed the posterior covariance information criterion (PCIC) to handle weighted likelihood inference.
result PCIC is asymptotically unbiased for quasi-Bayesian generalization error in weighted inference.
In this paper we investigate the behavioural differences between mobile phone customers with prepaid and postpaid subscriptions. Our study reveals that (a) postpaid customers are more active in terms of service usage and (b) there are strong structural correlations in the mobile phone call network as connections betwee…
Criterion for stopping conjugacy class enumeration in triangle groups.
problem Enumerating all conjugacy classes in cocompact triangle groups.
method Encoding by P. Dehornoy and T. Pinsky; stopping criterion based on geometric length.
result Stopping criterion for the generation of conjugacy classes in cocompact triangle groups.
In [D.A. Fedoseev, V.O. Manturov, A sliceness criterion for odd free knots,arXiv:1707.04923], the authors proved a sliceness criterion for odd free knots: free knots with odd chords. In the present paper we give a similar criterion for stably odd free knots. Some additional results on knot sliceness and cobordism are g…
New criterion for solving inverse Hessian equations, including J-equation.
problem Existence of solutions to inverse Hessian equations, including J-equation.
method Stability of pairs in the sense of Paul, formulated in terms of GIT criterion.
result New numerical criterion for existence of solutions to inverse Hessian equations.
Criterion for nilpotent Lie groups to have nilsolitons.
problem Existence of nilsolitons in nilpotent Lie groups.
method Algebraic criterion for nilpotent Lie algebras, proving necessary and sufficient condition for nilsolitons.
result Criterion provides a necessary and sufficient condition for nilpotent Lie groups to admit nilsolitons.
Study proposes a stopping criterion for active learning based on error stability.
problem Improving predictive performance in active learning by adaptively annotating samples.
method Proposes a stopping criterion based on error stability for Bayesian active learning.
result Demonstrates the proposed criterion stops active learning at the appropriate timing for various models and datasets.
Clarifies boundary criterion for non-one-ended subgroups in cubulation theory.
problem Boundary criterion for relative cubulation in non-one-ended subgroups.
method Showed that if boundary criterion is satisfied for a relatively hyperbolic group, the group admits a relatively geometric action on a CAT(0) cube complex.
result The refinement of the boundary criterion is useful for constructing new relative cubulations.
Extends Kelly Criterion to more complex betting scenarios.
problem Maximizing long-term growth in complex betting models.
method Generalizes Kelly Criterion to Lévy processes and high-frequency limits.
result Improved strategies for high-frequency betting.
Derives criteria for Kähler structures on holomorphic submersions.
problem Criteria for Kähler structures on holomorphic submersions.
method Derives a criterion for Kähler structures using holomorphic submersions.
result Proves Kähler structures for certain holomorphic submersions.
Partial answer to affineness of entire Grauert tubes, with Stein manifold criterion.
problem Affineness of entire Grauert tubes
method Generalized Demailly's criterion for Stein manifolds
result Complement of a codimension-one subset is affine
Optimizes recommendation models using skew normal distribution.
problem Improving personalized recommendation systems.
method Develops a new optimization criterion based on skew normal distribution.
result Significantly outperforms state-of-the-art models.
Criterion for solvability of complex 2-Hessian equation on compact Kähler manifolds.
problem Solvability of complex 2-Hessian equation on compact Kähler manifolds.
method Nakai--Moishezon-type criterion associated with the complex 2-Hessian equation.
result Criterion equivalent to existence of a smooth 2-admissible representative in complex dimension three.
Paper explains why small-loss criterion works for learning from noisy labels.
problem Learning from noisy labels in deep learning with limited labeled data.
method Theoretical analysis and reformulation of the small-loss criterion.
result Theoretical explanation and reformulation of the small-loss criterion.
New criterion assesses cluster separability for validation.
problem Validating cluster analysis results and determining the number of clusters.
method Distinguishability criterion, combined loss function-based framework.
result Validated cluster configurations and determined the number of clusters.
Criterion found for Teichmüller extremal maps on infinite Riemann surfaces.
problem Finding necessary and sufficient conditions for Teichmüller extremal maps.
method Established a criterion for Teichmüller-type extremal maps.
result Criterion for Teichmüller extremal maps on infinite Riemann surfaces.
This paper proves a Nakai-Moishezon criterion for complex Hessian equations.
problem The solvability of complex Hessian equations on Kähler manifolds.
method Establishing a Nakai-Moishezon criterion for Kähler classes on analytic Kähler varieties.
result Proves Lejmi-Szekelyhidi's conjecture for the J-equation. Criterion for subgroup separability in outer automorphism groups.
problem Subgroup separability in outer automorphism groups.
method Criterion for separability of subgroups.
result Strengthening and generalizing a previous result on mapping class groups.
The study provides a criterion to compute the total Thurston-Bennequin invariant of Legendrian graphs.
problem Computing the total Thurston-Bennequin invariant for Legendrian graphs.
method Generalized criterion for computing the total Thurston-Bennequin invariant from the tb of smaller cycles.
result The criterion holds for graphs with up to 9 vertices and for infinite families of examples.
Paper proposes an algorithm for robust estimation using Huber's criterion.
problem Non-convexity and non-robustness of joint maximum likelihood estimation.
method Block-wise minimization majorization framework with data-adaptive step sizes.
result Improved convergence and robustness in sparse learning.
Extends Milnor's criterion to biharmonic functions.
problem Deciding surface type for biharmonic functions.
method Generalizes Milnor's criterion to biharmonic functions.
result Characterizes whether a surface is hyperbolic or parabolic for biharmonic functions.
New proof of Kobayashi's properness criterion using metric geometry.
problem Properness of L-action on homogeneous spaces. method CAT(0) metric geometry on non-compact Riemannian symmetric spaces.
result Established a similar criterion for properness of L-action on homogeneous spaces. A new criterion for deep active learning selects minimal labeled data points.
problem Efficiently select minimal labeled data points for deep neural networks.
method Diffuses label information over a graph of data representations to switch between exploration and refinement.
result The diffusion-based criterion outperforms existing methods in deep active learning.
Study introduces combinatorial criterion for quasi-isometry groups of Euclidean spaces.
problem Determining quasi-isometries of Euclidean spaces.
method Introduces PLδ-homeomorphisms and combinatorial criterion using vertices and edges of simplicial structures. result The center of the quasi-isometry group QI(Rn) is trivial. We obtain a constructive criterion for robust no-arbitrage in discrete-time market models with transaction costs. This criterion is expressed in terms of the supports of the regular conditional upper distributions of the solvency cones. We also consider the model with a bank account. A method for construction of arbitr…
Study shows the corrected Akaike criterion is inadmissible for estimating Kullback-Leibler discrepancy.
problem Inadmissibility of the corrected Akaike information criterion for estimating Kullback-Leibler discrepancy.
method Loss estimation framework to demonstrate inadmissibility and provide improved estimators.
result Improved estimators of Kullback-Leibler discrepancy are provided and perform well in reduced-rank situations.