Partial convexification improves tractability of low-rank spectral optimization problems.
problem Minimizing linear objectives subject to matrix inequalities and low-rank constraints.
method Partial convexification of the domain set, deriving rank bounds, and developing a column generation algorithm.
result The partial convexification LSOP-R is equivalent to the original LSOP under certain conditions and yields high-quality solutions.
We introduce normalized nonnegative models (NNM) for explorative data analysis. NNMs are partial convexifications of models from probability theory. We demonstrate their value at the example of item recommendation. We show that NNM-based recommender systems satisfy three criteria that all recommender systems should ide…
The paper extends a neural model to estimate uncertainty in multi-interaction trajectory reconstruction.
problem Lack of uncertainty estimation in neural models for multi-interaction trajectory reconstruction.
method Extended Factorised Neural Relational Inference model to output mean and standard deviation for each component of the phase space vector, using various loss functions.
result Demonstrated the importance of physical meaning of variables and existence of local minima during training.
New dual approach for hedging Bermudan options efficiently.
problem Computing efficient hedging portfolios for Bermudan options.
method Pure dual approach, rewriting dual pricing formula as excess reward representation, strict convexification, Monte Carlo method.
result Convergence and effectiveness of the new algorithm tested on various Bermudan options.
The paper tackles fairness in forecasting and learning linear dynamical systems.
problem Under-representation bias in training data for multiple subgroups.
method Introducing subgroup-fair and instant-fair learning of LDS from multiple trajectories of varying lengths, using hierarchies of convexifications of non-commutative polynomial optimisation problems.
result Empirical results show both the beneficial impact of fairness considerations on statistical performance and encouraging effects of exploiting sparsity on run time.
Signal estimation problems with smoothness and sparsity priors can be naturally modeled as quadratic optimization with ℓ0-"norm" constraints. Since such problems are non-convex and hard-to-solve, the standard approach is, instead, to tackle their convex surrogates based on ℓ1-norm relaxations. In this paper…
New algorithm improves dataset distillation with 108% improvement on ImageNet.
problem Improving dataset distillation performance.
method Reparameterization and convexification of implicit gradients (RCIG).
result Establishes new state-of-the-art on various dataset distillation tasks.
Proposes a method to solve deep neural networks' local minimum problem.
problem Local minimum problem in deep neural networks training.
method Transforms cross-entropy loss into risk-averse error criterion, adjusts RSI, and uses convexity region.
result Trained deep learning machine is expected to be inside a global minimum's attraction basin.
New transforms improve signal classification and data analysis.
problem Improving signal classification and data analysis.
method Algebraic generative models and transport transforms.
result Classes of signals are transformed into convex sets, simplifying classification.
Traditionally, most complex intelligence architectures are extremely non-convex, which could not be well performed by convex optimization. However, this paper decomposes complex structures into three types of nodes: operators, algorithms and functions. Iteratively, propagating from node to node along edge, we prove tha…
Regularized empirical risk minimization with constrained labels (in contrast to fixed labels) is a remarkably general abstraction of learning. For common loss and regularization functions, this optimization problem assumes the form of a mixed integer program (MIP) whose objective function is non-convex. In this form, t…
The omnipresence of deep learning architectures such as deep convolutional neural networks (CNN)s is fueled by the synergistic combination of ever-increasing labeled datasets and specialized hardware. Despite the indisputable success, the reliance on huge amounts of labeled data and specialized hardware can be a limiti…
BP fails to find sparsest solution for structured matrices.
problem Finding sparsest solution to linear equations with structured matrices.
method Introduced class of structured matrices for BP failure.
result Determines columns corresponding to unrecoverable non-zero entries.
Given a C1 planes distribution PT on all Rm we consider {\em horizontal α-harmonic maps}, α≥1/2, with respect to such a distribution. These are maps u∈Hα(Rk,Rm) satisfying PT∇u=∇u and PT(u)(−Δ)αu=0 in D′(Rk). If the distrib…
DCCNNs reduce computational overhead and ambiguity in convolutional neural networks.
problem Reducing computational overhead and ambiguity in convolutional neural networks.
method Introducing a primal learning problem and constructing a dual convex training program, using Fenchel conjugates and Karush-Kuhn-Tucker conditions.
result Eliminates ambiguity and reduces computational overhead in constructing a large kernel matrix.
Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance. However, the exact model of sparse regression with an ℓ0 constraint restricting the support of the estimators is a challenging (\NP-hard) non-convex optimization problem. In this paper…
New bounds show complexity of adversarial decision making.
problem Understanding sample efficiency in adversarial decision making.
method New upper and lower bounds on Decision-Estimation Coefficient.
result Decision-Estimation Coefficient is necessary and sufficient for low regret in adversarial decision making.
The aim of this paper is to develop a general framework for training neural networks (NNs) in a distributed environment, where training data is partitioned over a set of agents that communicate with each other through a sparse, possibly time-varying, connectivity pattern. In such distributed scenario, the training prob…
An differential field (F;∂1,...,∂m) of characteristic zero, a subgroup H of affine group GL(n,C)∝Cn with respect to its identical representation in Fn and the following two fields of differential rational functions in x=(x1,x2,...,xn)-column vector, $$C< x, \partial >^H=\{f^{\part…
The L2-∂∂-Lemma is extended to complete Kähler manifolds with a gap in the spectrum.
problem Extending the L2-∂∂-Lemma to non-compact Kähler manifolds. method Proving the L2-∂∂-Lemma on complete Kähler manifolds with a gap in the spectrum. result The L2-∂∂-Lemma is generalized to complete Kähler manifolds. Sharp Hölder regularity found for complex Frobenius theorem coordinates.
problem Finding optimal Hölder-Zygmund regularity for complex Frobenius theorem coordinates.
method Analyzing necessary and sufficient conditions for coordinate charts achieving the theorem's structure.
result The optimal Hölder-Zygmund regularity for coordinate charts is shown to be α. In a recent paper~\cite{DDL10} we studied basic properties of partial immersions and partially free maps, a generalization of free maps introduced first by Gromov in~\cite{Gro70}. In this short note we show how to build partially free maps out of partial immersions and use this fact to prove that the partially free map…
Two-dimensional Riemannian manifolds uniquely determined by boundary data.
problem Determining a 2D Riemannian manifold from boundary data.
method Calderón problem approach using Dirichlet-to-Neumann operator.
result A 2D compact connected Riemannian manifold is uniquely determined up to conformal equivalence.
Study cohomologies of complex manifolds with symplectic forms and their stability.
problem Analyzing cohomologies of complex manifolds with symplectic forms.
method Investigate the Hard Lefschetz Condition on Dolbeault cohomology groups using a double complex.
result Stability of the ∂∂Λ-Lemma under small deformations of ω but not under complex structure. Let M be a surface sum of 3-manifolds M1 and M2 along a bounded connected surface F and ∂i be the component of ∂Mi containing F. If Mi has a high distance Heegaard splitting, then any minimal Heegaard splitting of M is the amalgamation of those of M1,M2 and M∗, where $M^i=M…
We present a simple, flexible, and general framework titled Partial Registration Network (PRNet), for partial-to-partial point cloud registration. Inspired by recently-proposed learning-based methods for registration, we use deep networks to tackle non-convexity of the alignment and partial correspondence problems. Whi…
The paper studies maps from pseudo-Hermitian to Kähler manifolds, proving harmonic map properties.
problem Analyzing maps between pseudo-Hermitian and Kähler manifolds.
method Investigates partial energy functionals and critical maps, proving foliated results for ∂b- and ∂b-harmonic maps. result Generalizes Siu's holomorphicity result to ∂b- and ∂b-harmonic maps. The paper proves Hodge decompositions and partial bar partial lemmas for G2 and Calabi-Yau manifolds.
problem Proving Hodge decompositions and partial bar partial lemmas for G2 and Calabi-Yau manifolds.
method Defining cohomology spaces analogous to Bott-Chern cohomology and relating them to harmonic forms on the manifolds.
result Geometric interpretation of cohomology classes in terms of submanifolds and gerbes for G2 manifolds.
The paper studies holomorphic Poisson manifolds and their deformations under specific cohomology conditions.
problem Understanding deformations of holomorphic Poisson manifolds under certain cohomological assumptions.
method Investigates properties of Koszul-Brylinski homology and Dolbeault cohomology, proving formality of a DGLA.
result The DGLA is shown to be formal, and Maurer-Cartan elements induce complex structure deformations.
The paper characterizes when the ∂∂-lemma holds for twistor spaces.
problem Characterizing the ∂∂-lemma for twistor spaces. method Study Bott-Chern and Aeppli cohomologies of twistor spaces.
result Explicit computation of Dolbeault cohomology for flat torus twistor space.
Let M be a compact hypersurface with boundary ∂M=∂D1∪∂D2, ∂D1⊂Π1, ∂D2⊂Π2, Π1 and Π2 two parallel hyperplanes in Rn+1 (n≥2). Suppose that M is contained in the slab determined by these hyperplanes and that the mean cu…
The paper studies deformations of Calabi-Yau manifolds using Gauduchon metrics.
problem Deformations of Calabi-Yau manifolds under co-polarised conditions.
method Analyzes local deformations of Calabi-Yau ∂∂ˉ-manifolds using Gauduchon metrics and constructs a new hp-HS form. result Proves the p-SKT h-∂∂ˉ-property is deformation open. Paper tackles distribution matching by partially matching distributions, achieving robust results.
problem Robustly aligning two probability distributions.
method Developed a partial Wasserstein adversarial network (PWAN) to efficiently approximate the partial Wasserstein-1 (PW) discrepancy.
result The PWAN effectively produces highly robust matching results, outperforming state-of-the-art methods.
We give a simple proof of a result on the ∂∂ˉ-lemma property under a blow-up transformation by Deligne--Griffiths--Morgan--Sullivan's criterion. Here, we use an explicit blow-up formula for Dolbeault cohomology given in our previous work, which can be induced by a morphism expressed on the level of…
Differential structure on partial isometries over Grassmannian constructed.
problem No specific problem stated; abstract focuses on method and result.
method Construction of differential structure on partial isometries over restricted Grassmannian.
result Set of partial isometries over restricted Grassmannian becomes a Banach Lie groupoid.
Ribbon cobordism forms a partial order in 3-manifolds.
problem Understanding partial orders in 3-manifolds.
method Utilizing recent methods from Ian Agol's work on knot concordance.
result Ribbon rational homology cobordism forms a partial order.
On a compact complex manifold X, we prove a Frölicher-type inequality for Bott-Chern cohomology and we show that the equality holds if and only if X satisfies the ∂∂-Lemma.
Abstract study of HKT manifolds, proving Hodge theory and formality properties.
problem Analyzing Hodge theory and formality in HKT manifolds.
method Study of Dolbeault operators and Laplacians, proving relations and properties.
result Formality of differential graded algebra for certain HKT manifolds.
On a compact ∂∂ˉ-manifold X, one has the Hodge decomposition: the de Rham cohomology groups split into subspaces of pure-type classes as HdRk(X)=⊕p+q=kHp,q(X), where the Hp,q(X) are canonically isomorphic to the Dolbeault cohomology groups H∂ˉp,q(X). F…
Study on 4-dimensional almost-Hermitian manifolds, proving ∂-harmonic forms invariant under certain metrics.
problem Proving ∂-harmonic forms are topological invariants for specific metrics on 4-dimensional almost-Hermitian manifolds. method Analyzing ∂-Laplacian and using globally conformally Kähler and strictly locally conformally Kähler metrics. result Dimension of ∂-harmonic (1,1)-forms is a topological invariant, answering Kodaira and Spencer's problem. We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between partial matchings. We introduce the notion of the lattice presentation of a par…
It is shown that any smooth strictly convex global solution of det(∂ξi∂ξj∂2u)=exp{−∑i=1ndi∂ξi∂u−d0}, where d0, d1,...,dn are constants, must be a quadratic polynomial. This extends a well-known theorem of Jö…
New theorems on Hodge numbers and Kähler structures derived from complex differential forms.
problem Deformation invariance and local stability of Hodge numbers and Kähler structures.
method Using the exponential operator and power series method, the approach focuses on d-closed extensions and foliated cases. result Local stabilities of transversely p-Kähler structures and new theorems on Hodge numbers. 3-manifold curvature comparison with rotationally symmetric bodies.
problem Comparing scalar curvature of 3-manifolds with rotationally symmetric boundaries.
method Inspired by Gromov, comparing mean curvatures and induced metrics.
result Flatness of 3-manifolds under certain curvature conditions.
Study shows partial hyperbolicity leads to Anosov dynamics in 3-manifolds.
problem Understanding dynamics in hyperbolic 3-manifolds and Seifert manifolds.
method Classification of partially hyperbolic diffeomorphisms and pseudo-Anosov dynamics.
result Complete classification of partially hyperbolic diffeomorphisms in hyperbolic 3-manifolds and Seifert manifolds.
We fully describe the horofunction boundary ∂hL2 with the word metric associated with the generating set {t,at} (i.e the metric arising in the Diestel-Leader graph DL(2,2)). The visual boundary ∂∞L2 with this metric is a subset of ∂hL2. Although $\partial_\infty L_2…
Paper categorifies a polynomial related to ribbon graphs.
problem Enumerating partial duals of ribbon graphs.
method Using an extended Frobenius algebra in unoriented topological quantum field theory.
result A categorification of the partial-dual genus polynomial.
New algorithm improves reinforcement learning from partial observations.
problem Inferior performance of algorithms in real-world reinforcement learning due to partial observability.
method Representation-based approach to POMDPs, leading to a tractable algorithm.
result Empirically demonstrates superior performance with partial observations.