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.
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.
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.
Extends multidimensional scaling to analyze three-way asymmetric proximities.
problem Analyzing asymmetric and three-way proximities in a Euclidean space.
method Unified h-plot methodology for three-way asymmetric proximities, including symmetric and conditional frameworks.
result Identification of archetypal profiles and clustering structures.
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.
Complex embeddings handle non-metric proximity data better than traditional methods.
problem Proximities not always metric or inner product-based, causing convergence issues.
method Proposes complex-valued embeddings for non-vectorial data.
result Complex embeddings outperform traditional techniques on benchmarks.
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.
Paper proposes a new method for supervised manifold learning using random forest proximities.
problem Existing supervised manifold learning methods fail to uncover meaningful embeddings due to using class-conditional distances.
method Proposes a data-geometry-preserving variant of random forest proximities as an initialization for manifold learning methods.
result Local and global structure preservation is near universal across manifold learning approaches using diffusion-based algorithms.
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. New method finds linear relationships across multiple data blocks using proximal gradient descent with ℓ1 constraint.
problem Finding leading generalized eigenvectors for multi-block CCA.
method Proximal gradient descent with ℓ1 constraint. result Rate-optimal solution under suitable assumptions.
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.
Proposes a graph pooling method leveraging node proximity for hierarchical graph representation learning.
problem Efficiently exploiting the geometry of graph data for hierarchical representation learning.
method Combines node proximity with kernel representation of topology and node features for adaptive node signal similarities evaluation.
result Achieves state-of-the-art performance on graph classification benchmark datasets.
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.
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.
Riemannian Proximal Sampler improves sampling on manifold data.
problem Sampling from densities on Riemannian manifolds.
method Uses MBI and RHK oracles for high-accuracy sampling.
result Sampling with ε-accuracy requires O(log(1/ε)) iterations in KL divergence.
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…
Gradient boosting is a prediction method that iteratively combines weak learners to produce a complex and accurate model. From an optimization point of view, the learning procedure of gradient boosting mimics a gradient descent on a functional variable. This paper proposes to build upon the proximal point algorithm, wh…
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.
This paper improves cross-domain learning using random forests for manifold alignment.
problem Improving cross-domain learning and feature integration.
method Semi-supervised manifold alignment using random forest proximities.
result Random forest proximities enhance downstream classification accuracy.
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.
RFX-Fuse combines Breiman and Cutler's Random Forest with modern ML capabilities.
problem Lack of a unified ML engine with diverse capabilities.
method Unified ML engine with native GPU/CPU support, delivering 5+ functionalities in one model.
result Native explainable similarity and imputation validation.
Paper uses UKS to improve BLE RSSI for proximity inference in mobile phone apps.
problem Improper BLE RSSI for accurate proximity inference during pandemics.
method Single-dimensional Unscented Kalman Smoother (UKS) with Gaussian process observation transforms.
result UKS outperforms traditional methods in predicting infection risk from BLE RSSI.
Randomized SINDy learns dynamic data structures using probabilistic methods.
problem Learning time-dependent data structures in dynamic systems.
method Sequential machine learning with a probabilistic approach, incorporating feature augmentation and Tikhonov regularization.
result Demonstrated effectiveness in regression and binary classification using real-world data.
The study combines social interaction data into a single network, identifying stable groups of chimpanzees.
problem Identifying stable groups of chimpanzees based on social interactions over time.
method Network representation, weighted proximity weights, principled loss function, statistical tests.
result The approach detects stable groups of chimpanzees that stay related for a significant length of time.
Deriving and applying Proximal Policy Optimization to GFlowNets for efficient training of discrete sampling policies
problem Training stochastic policies to sample from structured discrete probability distributions
method Deriving policy gradient algorithms for GFlowNets and applying Proximal Policy Optimization
result Improved convergence speed and data efficiency compared to standard GFlowNet training objectives
Federated learning approach for binary matrix factorization.
problem Efficiently factorizing binary data distributed across stakeholders while maintaining privacy.
method Proximal optimization for federated learning of relaxed binary matrix factorization.
result Federated algorithm outperforms state-of-the-art methods in quality and efficacy.
Inserts proximal mapping into deep networks for better regularization.
problem Effective regularization of deep learning models to handle adversarial perturbations and correlations between modalities.
method Proposes a new layer that directly produces regularized hidden layer outputs using proximal mapping.
result Outperforms state-of-the-art methods in robust temporal learning and multiview modeling.
Develops methods for personalized treatment decisions in the presence of unmeasured factors.
problem Personalized treatment decisions in the presence of unmeasured confounding.
method Proximal learning approaches to estimate optimal individualized treatment regimes (ITRs).
result Established identification results for different classes of ITRs, improving decision-making value function.
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.
Variational inference is a powerful approach for approximate posterior inference. However, it is sensitive to initialization and can be subject to poor local optima. In this paper, we develop proximity variational inference (PVI). PVI is a new method for optimizing the variational objective that constrains subsequent i…
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.
Enhances local explainability and trust scores using RF proximities.
problem Improving local explainability and trust in random forest models.
method Rewriting RF predictions as weighted sums of training targets using proximities.
result Proximities provide a novel method to assess model predictions' correctness.
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.
Improved time series classification with imputed data using label-guided forest-based methods.
problem Missing data in time series data.
method Label-guided imputation using forest-based proximity measures.
result Imputation leads to higher classification accuracies, even with imputed values differing from true values.
Proposes a new metric learning method for image recognition.
problem Improving image recognition performance using learned distance representations.
method Introduces a Generalized Hybrid Metric Loss (GHM-Loss) to learn hybrid proximity features combining geometric and probabilistic spaces.
result Demonstrates superior performance compared to existing methods on public datasets.
Efficient algorithms solve joint graphical lasso problems.
problem Learning graphical models from sparse data.
method Proximal gradient procedures with ADMM backtracking option.
result Proposed algorithms achieve high accuracy and precision.
Generative adversarial networks (GANs) represent a zero-sum game between two machine players, a generator and a discriminator, designed to learn the distribution of data. While GANs have achieved state-of-the-art performance in several benchmark learning tasks, GAN minimax optimization still poses great theoretical and…
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.
The paper analyzes convergence rates of Langevin dynamics and Proximal Sampler using Φ-divergence.
problem Analyzing convergence rates of Langevin dynamics and Proximal Sampler.
method Extending mixing time analyses to Φ-divergence, using strong data processing inequalities. result Convergence of Φ-divergence to 0 exponentially fast along Unadjusted Langevin Algorithm and Proximal Sampler. We consider a regularized least squares problem, with regularization by structured sparsity-inducing norms, which extend the usual ℓ1 and the group lasso penalty, by allowing the subsets to overlap. Such regularizations lead to nonsmooth problems that are difficult to optimize, and we propose in this paper a suit…
This paper accelerates TV regularization algorithms by unrolling proximal gradient descent.
problem Solving Total Variation (TV) regularized problems with iterative algorithms.
method Unrolling proximal gradient descent solvers to learn their parameters.
result Two approaches to compute derivatives through proximal operators improve performance.
Method uses NMF for clustering with partial distance measurements.
problem Proximity clustering with partial distance measurements.
method Nyström approximation with Nonnegative Matrix Factorization.
result Find nearly optimal clustering quality on synthetic and real-world data.
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.