Optimal joint separation condition for radar and communications channels in dual-blind deconvolution.
problem Recovering information from overlaid radar and communications signals with unknown channels.
method Extremal functions from Beurling-Selberg interpolation theory for joint separation, nuclear norm minimization for matrix retrieval, and MUSIC for parameter estimation.
result Guaranteed well-conditioned Vandermonde matrix for MUSIC, validating theoretical findings.
We consider convex-concave saddle point problems with a separable structure and non-strongly convex functions. We propose an efficient stochastic block coordinate descent method using adaptive primal-dual updates, which enables flexible parallel optimization for large-scale problems. Our method shares the efficiency an…
Fixed-parameter tractability of private synthetic data generation
problem Generating synthetic data under differential privacy
method Linear programming and subsampled private multiplicative weights method
result Optimal error rates across all regimes
We consider a generic convex-concave saddle point problem with separable structure, a form that covers a wide-ranged machine learning applications. Under this problem structure, we follow the framework of primal-dual updates for saddle point problems, and incorporate stochastic block coordinate descent with adaptive st…
TiAda adapts adaptive gradient methods for nonconvex minimax optimization.
problem Nonconvex minimax optimization challenges in achieving convergence.
method TiAda is a time-scale adaptive GDA algorithm for nonconvex minimax optimization.
result TiAda achieves near-optimal complexities in deterministic and stochastic settings.
We compute the quotient of the self-duality equation for conformal metrics by the action of the diffeomorphism group. We also determine Hilbert polynomial, counting the number of independent scalar differential invariants depending on the jet-order, and the corresponding Poincaré function. We describe the field of rati…
Blind source separation (BSS) is one of the most important and established research topics in signal processing and many algorithms have been proposed based on different statistical properties of the source signals. For second-order statistics (SOS) based methods, canonical correlation analysis (CCA) has been proved to…
The purpose of this article is to prove existence of mass minimizing integral currents with prescribed possibly non-compact boundary in all dual Banach spaces and furthermore in certain spaces without linear structure, such as injective metric spaces and Hadamard spaces. We furthermore prove a weak∗-compactness theo…
In this paper, we study randomized reduction methods, which reduce high-dimensional features into low-dimensional space by randomized methods (e.g., random projection, random hashing), for large-scale high-dimensional classification. Previous theoretical results on randomized reduction methods hinge on strong assumptio…
A fast method for training linear classifiers maximizes margins.
problem Training linear classifiers with maximum margins.
method Momentum-based gradient method derived from convex dual with Nesterov acceleration.
result Exponentially faster convergence rate compared to standard methods.
Recent years have witnessed the rapid development of block coordinate update (BCU) methods, which are particularly suitable for problems involving large-sized data and/or variables. In optimization, BCU first appears as the coordinate descent method that works well for smooth problems or those with separable nonsmooth …
Many supervised learning tasks are emerged in dual forms, e.g., English-to-French translation vs. French-to-English translation, speech recognition vs. text to speech, and image classification vs. image generation. Two dual tasks have intrinsic connections with each other due to the probabilistic correlation between th…
The paper proves vanishing bounded cohomology for various groups.
problem Vanishing bounded cohomology for specific groups.
method Elementary algebraic criterion called the commuting cyclic conjugates condition.
result Many groups of interest have vanishing bounded cohomology.
DPTA improves CIL by adapting PTMs with dual prototypes.
problem Catastrophic forgetting in incremental learning with pre-trained models.
method Dual-Prototype Network with Task-wise Adaptation (DPTA).
result DPTA consistently outperforms recent methods by 1\%-5\% on multiple benchmarks.
Unified view connects CoCoA and ADMM for distributed ERM.
problem Connection between CoCoA and ADMM for distributed ERM.
method Unified primal-dual perspective reformulation.
result Unified ADMM variants perform at least as good as CoCoA in ridge-regularized ERM.
This paper shows that the implicit bias of gradient descent on linearly separable data is exactly characterized by the optimal solution of a dual optimization problem given by a smoothed margin, even for general losses. This is in contrast to prior results, which are often tailored to exponentially-tailed losses. For t…
Recent several years have witnessed the surge of asynchronous (async-) parallel computing methods due to the extremely big data involved in many modern applications and also the advancement of multi-core machines and computer clusters. In optimization, most works about async-parallel methods are on unconstrained proble…
This paper studies the continuous time utility maximization problem on consumption with addictive habit formation in incomplete semimartingale markets. Introducing the set of auxiliary state processes and the modified dual space, we embed our original problem into a time-separable utility maximization problem with a sh…
Dual neural network architecture improves accuracy and interpretability.
problem Improving neural network interpretability and accuracy.
method Stacked recurrent and feedforward layers, binary activation function.
result Binary activation leads to simpler, more interpretable models with higher accuracy.
We study optimal solutions to an abstract optimization problem for measures, which is a generalization of classical variational problems in information theory and statistical physics. In the classical problems, information and relative entropy are defined using the Kullback-Leibler divergence, and for this reason optim…
Study of surface defects in gauge theories leads to duality and separation of variables.
problem Understanding surface observables and their transitions in gauge theories.
method Utilized Fourier transformations and spectral problems to derive dualities and separation of variables.
result Exact duality between spectral problems of spin chains and Gaudin models.
DISCoVeR learns disentangled representations by separating shared and condition-specific factors.
problem Learning disentangled representations for multi-condition data.
method Dual-latent architecture, parallel reconstructions, max-min objective.
result DISCoVeR achieves improved disentanglement on various datasets.
We extend the theoretical analysis of a recently proposed single subspace learning algorithm, called Dual Principal Component Pursuit (DPCP), to the case where the data are drawn from of a union of hyperplanes. To gain insight into the properties of the ℓ1 non-convex problem associated with DPCP, we develop a geo…
Paper studies optimal tracking portfolio in mean field game of large fund competition.
problem Optimal tracking portfolio in large fund competition with relative performance benchmark.
method Formulated mean field game problem, established existence of mean field equilibrium using PDE approach, constructed approximate Nash equilibrium.
result Existence of mean field equilibrium and consistency condition verified.
NeAda solves nonconvex minimax optimization by balancing primal and dual variables adaptively.
problem Nonconvex minimax optimization challenges with parameter-agnostic adaptive algorithms.
method Nested Adaptive (NeAda) framework with inner and outer loops for primal and dual variables.
result Achieves near-optimal convergence rates for nonconvex-strongly-concave problems.
Constructing Einstein analogues with a non-zero cosmological constant
problem Constructing an Einstein analogue with a non-zero cosmological constant
method Proving the solution is either the Plebański-Demiański metric or has an anti-self-dual Weyl tensor
result For λ < 0, there is a conformal infinity separating two asymptotically hyperbolic metrics; one is globally conformal to an ALE scalar-flat Kähler metric; gravitational instantons with different topologies are constructed; the geometry is a 4-pole solution in the Calderbank-Pedersen classification
We present ADMM-Softmax, an alternating direction method of multipliers (ADMM) for solving multinomial logistic regression (MLR) problems. Our method is geared toward supervised classification tasks with many examples and features. It decouples the nonlinear optimization problem in MLR into three steps that can be solv…
RL framework optimizes trading costs in noisy markets.
problem Optimal execution and placement in noisy markets.
method Dual-window Denoise PPO RL network, imitation learning, comprehensive market features, flexible action formulation.
result RL agents outperformed TWAP strategy in execution cost.
This paper solves the dual Minkowski problem for q-torsional rigidity.
problem The dual Minkowski problem for q-torsional rigidity.
method Introduced the p-th dual q-torsional measure and solved the p-th dual Minkowski problem for q-torsional rigidity using a Gauss curvature flow.
result Existence of smooth even and non-even solutions to the p-th dual Minkowski problem for q-torsional rigidity.
Researchers prove uniqueness and continuity of solution to L_p dual Minkowski problem.
problem Proving uniqueness and continuity of solution to L_p dual Minkowski problem.
method Established new Minkowski-type inequalities related to optimization problem.
result Uniqueness and continuity of solution for general convex bodies when q<p. Solves a generalized dual Minkowski problem for specific values of q.
problem Finding solutions to the generalized dual Minkowski problem for given q and star bodies.
method Variational methods
result Existence of solutions for q<0 and 0≤q≤1, sufficient condition for q>1.
Dual martingales improve primal optimal stopping problem efficiency.
problem Optimal stopping problem in the primal formulation.
method Investigation of dual martingales to improve primal methods.
result Accurate dual martingale approximations reduce primal problem variance.
Study anisotropic inverse Gauss curvature flows and solve dual Orlicz Minkowski problems.
problem Solving dual Orlicz Minkowski problems for anisotropic flows.
method Anisotropic inverse Gauss curvature flows and stationary solutions.
result New existence results for dual Orlicz Minkowski problems for smooth measures.
We show that a Hitchin representation is determined by the spectral radii of the images of simple, non-separating closed curves. As a consequence, we classify isometries of the intersection function on Hitchin components of dimension 3 and on the self-dual Hitchin components in all dimensions. As an important tool in t…
We present an efficient algorithm for maximum likelihood estimation (MLE) of exponential family models, with a general parametrization of the energy function that includes neural networks. We exploit the primal-dual view of the MLE with a kinetics augmented model to obtain an estimate associated with an adversarial dua…
In this paper, the dual Orlicz curvature measure is proposed and its basic properties are provided. A variational formula for the dual Orlicz-quermassintegral is established in order to give a geometric interpretation of the dual Orlicz curvature measure. Based on the established variational formula, a solution to the …
Using Fedosov's approach we give a geometric construction of a formal symplectic groupoid over any Poisson manifold endowed with a torsion-free Poisson contravariant connection. In the case of Kaehler-Poisson manifolds this construction provides, in particular, the formal symplectic groupoids with separation of variabl…
Starting from a bundle E over R, the dual of the first jet bundle, which is a co-dimension 1 sub-bundle of the cotangent bundle of E, is the appropriate manifold for the geometric description of time-dependent Hamiltonian systems. Based on previous work, we recall properties of the complete lifts of a type (1,1) tensor…
Diffusion models can memorize training data, limiting their creativity and privacy.
problem Memorization in diffusion models that reproduces training data instead of generating novel outputs.
method Dual-separation approach via statistical estimation and network approximation.
result Pruning-based method reduces memorization while maintaining generation quality.
The goal of decentralized optimization over a network is to optimize a global objective formed by a sum of local (possibly nonsmooth) convex functions using only local computation and communication. It arises in various application domains, including distributed tracking and localization, multi-agent co-ordination, est…
We characterize the class of separable Banach spaces X such that for every continuous function f:X→R and for every continuous function ε:X→(0,+∞) there exists a C1 smooth function g:X→R for which ∣f(x)−g(x)∣≤ε(x) and g′(x)=0 for all x∈X (that is, g has no…
Dual-CLVSA predicts financial markets using both trading data and sentiment measurements.
problem Predicting financial markets with complex interactions and emotional influences.
method Hybrid convolutional LSTM-based variational sequence-to-sequence model with attention.
result Dual-CLVSA effectively fuses trading data and sentiment measurements, improving prediction performance.
Efficient algorithm solves best subset selection problem.
problem Sparse learning problems, especially best subset selection.
method Primal-dual method based on dual forms of ℓ0-regularized problems. result Improves solutions of best subset selection with reduced redundant computation.
Paper solves dual Minkowski problem in 2D plane for specific curvature cases.
problem Finding the number of solutions to the dual Minkowski problem in 2D with constant curvature.
method Combining theoretical analysis and numerical estimation of an integral with parameters.
result Found the number of solutions for the constant dual curvature case when 0<q≤4. Extends Lannes-Quillen theorem to all profinite groups.
problem Conjugacy separability of p-torsion elements and finite p-subgroups. method Developed a theory of products for families of discrete torsion modules.
result Proves a full version of the Lannes-Quillen theorem for all profinite groups.
Optimizes subset selection in sparse learning problems.
problem Sparse learning problems, particularly best subset selection.
method Developed an efficient primal-dual algorithm leveraging dual range estimation and incremental strategy.
result Improves solutions of best subset selection with reduced redundant computation.
Paper estimates GMMs with unknown covariances using sparse regularization.
problem Estimating GMMs with unknown diagonal covariances from samples.
method Employed Beurling-LASSO (BLASSO) for sparse estimation of component means, covariances, and weights.
result Established non-asymptotic recovery guarantees with nearly parametric convergence rates.
We study projectively self-dual polygons and curves in the projective plane. Our results provide a partial answer to problem No 1994-17 in the book of Arnold's problems.