Proper proximality proved for various groups on non-positive curvature spaces.
problem Proper proximality of groups acting on non-positive curvature spaces.
method Established proper proximality for groups acting on CAT(0) spaces and hierarchically hyperbolic groups. result Proper proximality of many groups including mapping class groups and subgroups of curve graphs.
Paper relates asymptotic dimension to cofinal dimension using coarse proximities.
problem Relating asymptotic dimension to cofinal dimension in metric spaces.
method Introducing coarse proximities and inverse limit constructions.
result Asymptotic dimension is bounded by coarse cofinal dimension and cofinal dimension of Higson corona.
Stochastic proximal point algorithm with momentum converges faster and is more stable than standard methods.
problem Improving convergence and stability of stochastic optimization methods.
method Developed and analyzed the convergence and stability of the stochastic proximal point algorithm with momentum (SPPAM).
result SPPAM converges faster and is more stable than standard stochastic proximal point algorithm (SPPA) and stochastic gradient descent with momentum (SGDM).
In this paper, we study the proximal gradient algorithm with extrapolation for minimizing the sum of a Lipschitz differentiable function and a proper closed convex function. Under the error bound condition used in [19] for analyzing the convergence of the proximal gradient algorithm, we show that there exists a thresho…
We consider a class of nonconvex nonsmooth optimization problems whose objective is the sum of a smooth function and a finite number of nonnegative proper closed possibly nonsmooth functions (whose proximal mappings are easy to compute), some of which are further composed with linear maps. This kind of problems arises …
The paper analyzes PPM for nonconvex-nonconcave problems, identifying three regions with varying convergence guarantees.
problem Challenges in nonconvex-nonconcave minimax optimization.
method Classic proximal point method with insights from the Moreau envelope.
result Identification of three regions with varying convergence guarantees for PPM.
In this paper, we consider a class of possibly nonconvex, nonsmooth and non-Lipschitz optimization problems arising in many contemporary applications such as machine learning, variable selection and image processing. To solve this class of problems, we propose a proximal gradient method with extrapolation and line sear…
Informed by recent work on tensor singular value decomposition and circulant algebra matrices, this paper presents a new theoretical bridge that unifies the hypercomplex and tensor-based approaches to singular value decomposition and robust principal component analysis. We begin our work by extending the principal comp…
We consider the problem of minimizing the sum of a smooth function h with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function P and a surjective linear map M, with the proximal mappings of τP, τ>0, simple to compute. This problem i…
In this paper we consider the composite self-concordant (CSC) minimization problem, which minimizes the sum of a self-concordant function f and a (possibly nonsmooth) proper closed convex function g. The CSC minimization is the cornerstone of the path-following interior point methods for solving a broad class of co…
In machine learning research, the proximal gradient methods are popular for solving various optimization problems with non-smooth regularization. Inexact proximal gradient methods are extremely important when exactly solving the proximal operator is time-consuming, or the proximal operator does not have an analytic sol…
Improves time series classification with forest proximities.
problem Time series classification accuracy and efficiency.
method PF-GAP, an extension of RF-GAP proximities to proximity forests, combined with Multi-Dimensional Scaling and Local Outlier Factors.
result Forest proximities show stronger connection between misclassified points and outliers.
Improved sampling guarantees for weakly log-concave distributions.
problem Sampling from distributions that are not strongly log-concave.
method Proximal sampler with convergence guarantees under weaker assumptions.
result New state-of-the-art sampling guarantees for various target distributions.
New algorithm recovers matrices with unknown correspondences.
problem Recovering matrices from observations with unknown correspondences.
method Solves a nuclear norm minimization problem via proximal gradient with a Max-Oracle.
result Achieves state-of-the-art performance and high accuracy in recovering ground-truth correspondences.
CFR-Pro enhances treatment effect estimation by incorporating local proximity.
problem Treatment selection bias in HTE estimation from observational data.
method Proximity-enhanced CounterFactual Regression (CFR-Pro) with pair-wise proximity regularizer and subspace projector.
result Significantly outperforms competitors in HTE estimation accuracy.
Improved random forest proximities capture data geometry.
problem Inaccurate random forest proximities do not reflect learned data geometry.
method Introduce RF-GAP: Geometry- and Accuracy-Preserving proximities.
result RF-GAP improves geometric representation in tasks like data imputation.
Introduces PPMM algorithm for nonconvex robust regression problems.
problem Nonconvex tuning-free robust regression problems.
method PPMM algorithm with inner subproblems solved by SSN-PPA.
result Converges to d-stationary point with KL property.
Paper analyzes convergence of proximal algorithm in metric spaces without geodesic convexity.
problem Analyzing convergence of proximal algorithm in general metric spaces.
method Analysis of the Wasserstein proximal algorithm without geodesic convexity assumption.
result Establishes unbiased and linear convergence rate for proximal algorithm under natural Wasserstein inequality.
Extends RF proximities to all supervised distance-based machine learning contexts.
problem Limited utility of RF proximities in various machine learning tasks.
method Introduces generalized Proximity Forest (PF) model and variant for regression.
result Demonstrates unique advantages over RF and k-nearest neighbors models.
Improved bounds for proximal gradient algorithms with computational errors.
problem Analyzing convergence of proximal gradient algorithms with inaccuracies.
method Deriving new tighter deterministic and probabilistic bounds for convex composite problems.
result Probabilistic bounds are more robust and accurate for algorithm verification and performance guarantees.
Paper extends theorem on covering spaces and Jordan curves.
problem Covering and extending theorems for Alexandrov spaces.
method Introduces proximal homotopic cycles to extend the Mitsuishi-Yamaguchi theorem.
result Extensions of the Mitsuishi-Yamaguchi Good Covering Theorem and Jordan curve theorem.
TOPPO improves PPO for MTRL by balancing critic gradients, outperforming SAC.
problem Critic-side gradient ill-conditioning in PPO for MTRL.
method Critic Balancing modules to improve gradient conditioning and balance task updates.
result TOPPO achieves stronger mean and tail-task performance than SAC-family and ARS-family baselines.
New algorithm tackles complex optimization problems with inexact and stochastic methods.
problem Solving complex optimization problems with inexact and stochastic methods.
method Developed ICGALP algorithm for composite minimization problems with inexact computations.
result Convergence of Lagrangian to an optimum and asymptotic feasibility of the affine constraint.
Proximal algorithms applied to current deformation into cycles.
problem Deformation of de Rham currents into cycles.
method Proximal algorithms, total variation denoising for differential forms.
result Calibrated cycles constructed in calibrated manifolds.
Innovative method solves nonconvex optimization on manifolds.
problem Nonconvex optimization problems on Riemannian manifolds.
method Intrinsic Riemannian proximal gradient method.
result Converges for nonconvex or nonembedded problems.
New PnP algorithm converges with relaxed proximal gradient descent.
problem Convergence issues in PnP methods with deep denoisers.
method Relaxed proximal gradient descent for PnP with weakly convex regularization.
result Proposed PnP-αPGD converges for a wider range of regularization parameters. EPINE enhances network embedding by improving adjacency matrix-based high-order proximity.
problem Inaccurate and poorly designed calculation of high-order proximity in network embedding.
method EPINE redefines high-order proximity intuitively and proposes a scalable algorithm for accurate calculation.
result EPINE outperforms existing methods in network reconstruction, link prediction, and node classification.
Stochastic version of proximal distance algorithm analyzed and validated.
problem Optimization of constrained estimation problems.
method Stochastic proximal distance algorithm, with convergence guarantees and finite error bounds.
result Convergence guarantees and finite error bounds for the first time.
This paper extends the Good Covering Theorem and Jordan Curve Theorem for proximal Alexandrov spaces.
problem Extending the Good Covering Theorem and Jordan Curve Theorem to proximal Alexandrov spaces.
method Introducing path cycles and using them to extend the Good Covering Theorem and Jordan Curve Theorem.
result Extensions of the Mitsuishi-Yamaguchi Good Covering Theorem and Jordan Curve Theorem for proximal Alexandrov spaces.
This paper studies fixed sets in ribbon complexes using descriptive proximity spaces.
problem Understanding fixed sets in ribbon complexes within descriptive proximity spaces.
method Introduces descriptive fixed sets and their properties in ribbon complexes, using descriptive proximally continuous maps.
result Establishes that proximal descriptive conjugacy preserves fixed sets in ribbon complexes.
Introduces a new divergence measure for optimal transport.
problem Optimal transport distances and information divergences.
method Infimal convolution formulation of proximal optimal transport divergence.
result Establishes connections to dynamic formulations and partial differential equations.
We propose a new proximal, path-following framework for a class of constrained convex problems. We consider settings where the nonlinear---and possibly non-smooth---objective part is endowed with a proximity operator, and the constraint set is equipped with a self-concordant barrier. Our approach relies on the followin…
Unified framework for training neural networks with non-smooth, non-convex regularizers.
problem Training neural networks with non-smooth, non-convex regularizers.
method ProxGen framework for stochastic proximal gradient descent.
result ProxGen framework achieves the same convergence rate as standard methods and outperforms subgradient-based approaches.
A new method reformulates Optimal Transport Conditional Flow Matching using proximal operators.
problem Optimal Transport Conditional Flow Matching (OT-CFM) for generating models.
method Reformulate OT-CFM using proximal operators and extended Brenier potential.
result OT-CFM dynamics are terminally normally hyperbolic for manifold-supported targets.
SMP model preserves proximity and permutation in graph neural networks.
problem Challenges in graph mining, such as community and leader finding.
method Stochastic Message Passing (SMP) model that maintains proximity and permutation-equivariance.
result SMP model effectively preserves node proximities and permutation-equivariance.
Many machine learning techniques sacrifice convenient computational structures to gain estimation robustness and modeling flexibility. However, by exploring the modeling structures, we find these "sacrifices" do not always require more computational efforts. To shed light on such a "free-lunch" phenomenon, we study the…
Proposes BMME for optimizing nonsmooth nonconvex problems with block structure.
problem Optimizing nonsmooth nonconvex problems with block structure.
method Block Alternating Bregman Majorization Minimization with Extrapolation (BMME).
result Subsequential convergence to a first-order stationary point under mild assumptions, global convergence under stronger conditions.
We consider the problem of minimizing a difference-of-convex (DC) function, which can be written as the sum of a smooth convex function with Lipschitz gradient, a proper closed convex function and a continuous possibly nonsmooth concave function. We refine the convergence analysis in [38] for the proximal DC algorithm …
Proximal Diffusion Models improve generative model efficiency.
problem Improving generative model efficiency and accuracy.
method Developed Proximal Diffusion Models using proximal maps instead of scores.
result Proximal Diffusion Models achieve faster convergence and higher accuracy.
Deep neural networks improve proximal inference for causal effects.
problem Estimating causal effects in the presence of unmeasured confounders.
method Flexible deep neural network to estimate the bridge function.
result Achieves state-of-the-art performance on benchmarks.
In this paper we develop proximal methods for statistical learning. Proximal point algorithms are useful in statistics and machine learning for obtaining optimization solutions for composite functions. Our approach exploits closed-form solutions of proximal operators and envelope representations based on the Moreau, Fo…
Enhances Bayesian model selection for high-dimensional problems.
problem Bayesian model selection for high-dimensional problems.
method Proximal nested sampling with data-driven priors.
result Improves model selection for log-convex likelihood models.
We analyze the local convergence of proximal splitting algorithms to solve optimization problems that are convex besides a rank constraint. For this, we show conditions under which the proximal operator of a function involving the rank constraint is locally identical to the proximal operator of its convex envelope, hen…
The need for parameter estimation with massive datasets has reinvigorated interest in stochastic optimization and iterative estimation procedures. Stochastic approximations are at the forefront of this recent development as they yield procedures that are simple, general, and fast. However, standard stochastic approxima…
New method for efficient proximal mapping of 1-path-norm in shallow networks.
problem Efficiently handling the 1-path-norm of shallow neural networks.
method Closed-form proximal operator for efficient computation and upper bound on Lipschitz constant.
result Proximal mapping allows robust training against adversarial perturbations.
In this work, we highlight a connection between the incremental proximal method and stochastic filters. We begin by showing that the proximal operators coincide, and hence can be realized with, Bayes updates. We give the explicit form of the updates for the linear regression problem and show that there is a one-to-one …
Develops a new SPP algorithm with variance reduction for weakly convex optimization.
problem Weakly convex, composite optimization problems.
method Inexact semismooth Newton framework with variance reduction for stochastic proximal point updates.
result Establishes convergence results for the proposed algorithm.
PDNS tackles multimodal sampling challenges using proximal point method.
problem Multimodal distributions with significant barriers between modes.
method Proximal point method on path measures, decomposing into simpler subproblems.
result PDNS effectively promotes thorough exploration across modes.