Study of integral flows on Riemannian manifolds with focus on blow-up profiles and concentration-compactness.
problem Analyzing nonlinear integral flows on Riemannian manifolds with specific focus on blow-up profiles and concentration-compactness.
method Investigation of a family of nonlinear integral flows involving Riesz potentials, focusing on the Hardy-Littlewood-Sobolev (HLS) subcritical and critical regimes.
result Established convergence on unit spheres and certain locally conformally flat manifolds for the dual Yamabe flow.
Paper studies lambda constants and ground states of Perelman's W-functional.
problem Estimating lambda constants and existence of ground states of Perelman's W-functional.
method Variational formulation and Lions' concentration-compactness method.
result Theorems 2, 3, and 7 provide existence results for ground states.
Proves continuity and singular set dimension for 2D maps with Q values.
problem Interior regularity of 2D Q-valued maps. method Strong concentration-compactness theorem for equicontinuous maps.
result 2D Q-valued maps are Hölder continuous with singular set dimension ≤1. Study convergence of Yamabe flow on singular spaces with positive constant.
problem Analyzing convergence of Yamabe flow on singular spaces.
method Normalized Yamabe flow with positive Yamabe constant on pseudo-manifolds, including stratified spaces.
result Established convergence under low energy condition and investigated alternatives.
Solves Yamabe problem on compact manifolds using variational methods.
problem Solving the Yamabe problem on compact Riemannian manifolds.
method Variational approach, conformal transformations, Concentration-Compactness method.
result The Yamabe problem is solvable when the manifold's Yamabe invariant is less than that of the sphere.
We investigate different concentration-compactness phenomena related to the Q-curvature in arbitrary even dimension. We first treat the case of an open domain in R2m, then that of a closed manifold and, finally, the particular case of the sphere S2m. In all cases we allow the sign of the Q-curvature to vary, …
In this paper we study the local regularity of closed surfaces immersed in a Riemannian 3-manifold flowing by Willmore flow. We establish a pair of concentration-compactness alternatives for the flow, giving a lower bound on the maximal time of existence of the flow proportional to the concentration of the curvature an…
The paper examines stability of Sobolev inequalities on manifolds with Ricci curvature bounds.
problem Stability of Sobolev inequalities on Riemannian manifolds with Ricci curvature lower bounds.
method Generalized Lions' concentration compactness and rigidity results of Sobolev inequalities on singular spaces.
result Almost extremal functions are close to extremal functions on the round sphere and Euclidean Sobolev inequality.
Chen's flow leads to finite-time singularities for closed submanifolds.
problem Understanding the finite-time singularities of Chen's fourth-order curvature flow.
method Investigates the flow's behavior, proving finite-time extinction and concentration of curvature.
result Chen's flow leads to finite-time singularities for closed submanifolds, characterized by concentration of curvature in specific dimensions.
In this paper, we observe a set of functionals of metrics which are all decrease under the Calabi flow and have uniform lower bound along the flow, which give rise to a set of integral estimates on the curvature flow. Using these estimates, together with weak compactness we obtained in previous papers [8] and [10], we …
Study on extremizers for Sobolev inequality on curved manifolds.
problem Existence of extremizers for the sharp p-Sobolev inequality on Riemannian manifolds with nonnegative curvature. method Nonsmooth concentration compactness methods and Mosco-convergence results for Cheeger energy.
result Almost extremal functions are close to radial Euclidean bubbles and almost zero globally under nonnegative curvature.
In this paper we study the steepest descent L2-gradient flow of the functional $\SW_{λ_1,λ_2}$, which is the the sum of the Willmore energy, λ1-weighted surface area, and λ2-weighted enclosed volume, for surfaces immersed in R3. This coincides with the Helfrich functional with zero `spontaneous curvature'.…
Rigidity and almost rigidity of Sobolev inequalities on compact spaces with lower Ricci curvature bounds.
problem Characterizing and proving rigidity and almost rigidity of Sobolev inequalities on compact spaces with lower Ricci curvature bounds.
method Analysis of Riemannian manifolds and metric measure spaces with synthetic lower Ricci curvature bounds, using concentration compactness and Polya-Szego inequalities.
result Closed Riemannian manifolds with optimal Sobolev constant are isometric to the sphere, and almost equality implies close measure Gromov-Hausdorff convergence to a spherical suspension.
The paper studies how adding a 'Gauge Mass' term breaks gauge symmetry in Yang-Mills-Higgs systems and analyzes the resulting behavior.
problem Breaking gauge symmetry in Yang-Mills-Higgs systems.
method Analyzing the asymptotic behavior of the system with a 'Gauge Mass' term added.
result The system's behavior is characterized by concentration phenomena and convergence to harmonic maps and minimal energies.
Improved iterative methods for risk parity portfolio weights.
problem Solving for portfolio weights in risk parity allocation.
method Enhanced CCD and Newton methods, including a rescaling step and improved initial guess.
result Improved CCD method is the best, three times faster with 40% fewer iterations.
Paper introduces stochastic mesh methods for efficient CVA computation.
problem Efficient computation of CVA for large systems using Monte Carlo methods.
method Introduces two stochastic mesh methods for CVA computation.
result Demonstrates the rate of convergence of the methods to real CVA values.
A new method combines Laplace and Variational Bayes for scalable inference.
problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
A new method speeds up optimization for sums, simpler than others.
problem Optimizing finite sums, especially in non-smooth cases.
method A novel accelerated method based on SAGA, with one parameter.
result Achieves accelerated convergence on strongly convex smooth problems.
Unified analysis of momentum methods for deep learning.
problem Convergence analysis of stochastic momentum methods for convex and non-convex optimization.
method Developed a convergence analysis for two stochastic momentum methods.
result Unified framework revealing similarities and differences between methods.
This work reviews and evaluates methods for predicting prediction intervals in regression problems.
problem Calibration of prediction intervals in regression problems.
method Four classes of methods: Bayesian, ensemble, direct interval estimation, and conformal prediction.
result Conformal prediction can be used as a general calibration procedure.
Derives kernel PCA with Nyström method for scalability.
problem Scalability of kernel PCA.
method Nyström method for kernel PCA.
result Provides scalable alternative to full kernel PCA.
Develops a fast method for pricing American options under variance gamma model.
problem Inefficient methods for pricing American options under variance gamma model.
method Inspired by quadratic approximation method, uses machine learning on pre-calculated quantities to reduce error.
result Proposed method is efficient and accurate for practical use.
Two RBF methods solve complex financial derivatives pricing problems.
problem Pricing derivatives in models with multiple stochastic factors.
method Radial Basis Function Partition of Unity and Radial Basis Function generated Finite Differences methods.
result Both methods achieve high accuracy and are efficient for solving multi-dimensional PDEs.
New method combines spectral and sparse methods for Gaussian processes.
problem Efficiently fitting Gaussian processes to large datasets.
method Orthogonally decoupled variational Fourier features.
result Competitive performance on synthetic and real-world data.
Simple stochastic Newton and cubic Newton methods with fast convergence.
problem Minimizing large numbers of smooth and strongly convex functions.
method Stochastic Newton and cubic Newton methods with simple local linear-quadratic rates.
result Local linear-quadratic convergence results with fast adaptation to problem's curvature.
Improved spectral methods of moments for robust latent variable model learning.
problem Limited robustness of spectral methods of moments to model misspecification.
method Hierarchical approach using approximate joint diagonalization instead of tensor decomposition.
result Our method outperforms previous tensor decomposition methods in speed and model quality.
VAN method optimizes learning tasks with unified methods.
problem Optimizing learning tasks in active and reinforcement learning.
method Variational Adaptive-Newton method that unifies optimization, inference, and evolution strategies.
result VAN performs well on various learning tasks.
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.
New methods using natural gradient for structured optimization.
problem Structured optimization problems.
method Structured second-order methods via natural gradient descent.
result Efficiency demonstrated on non-convex and deep learning problems.
Improved A2C method with lower variance.
problem Reducing variance in deep policy gradient methods.
method Using control variate theory, derived a new A2C formulation with lower variance.
result New A2C method has lower variance and improved performance.
A new method speeds up deep neural network training.
problem Nonconvex optimization in deep neural networks.
method Scaled conjugate gradient method for nonconvex optimization.
result The method converges faster and achieves lower scores in practical applications.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
NCG methods improve shape optimization efficiency.
problem Shape optimization problems
method Nonlinear conjugate gradient methods
result NCG methods are efficient for shape optimization
Proposes UTC method for stock price prediction with uncertainty quantification.
problem Lack of uncertainty estimates in stock prediction methods.
method Combines TC method with probabilistic modeling for point and uncertainty predictions.
result UTC method achieves higher returns and lower risks than baselines.
Various approaches to gene selection for cancer classification based on microarray data can be found in the literature and they may be grouped into two categories: univariate methods and multivariate methods. Univariate methods look at each gene in the data in isolation from others. They measure the contribution of a p…
Survey of spectral, probabilistic, and deep metric learning methods.
problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.
Geometric methods study 3-manifold splittings.
problem Studying Heegaard splittings of 3-manifolds.
method Geometric approaches.
result Recent advances in geometric methods.
A novel weighted feature selection method using fuzzy sets improves classification accuracy and stability.
problem Improving feature selection accuracy and stability in machine learning models.
method Combination of four feature selection methods using fuzzy sets and bootstrap.
result Our method achieved significantly higher stability than individual methods.
New method improves accuracy in computing implied volatility.
problem Computing implied volatility from the Black-Scholes model.
method Adaptive gradient descent optimizers for numerical computation.
result More accurate results compared to close form approximation and Newton-Raphson method.
The paper examines Wiener process for LID estimation methods.
problem Estimating local intrinsic dimension in high-dimensional datasets.
method Investigates recent LID estimation methods from a Wiener process perspective.
result Explains how methods behave under non-ideal conditions.
Discuss ML methods for economists, highlighting better performance in econometrics.
problem Applying ML methods to econometrics problems.
method Supervised and unsupervised learning methods, matrix completion, causal inference, optimal policy estimation.
result ML methods often outperform traditional econometric methods in specific econometrics problems.
New method detects business-relevant outliers in e-commerce conversion rates.
problem Identifying outliers in e-commerce conversion rate data.
method A novel unsupervised fluid IQR method that adjusts sensitivity based on platform activity.
result Fluid IQR method outperforms existing methods in business-relevance and robustness.
Saliency methods often misattribute predictions due to input transformations.
problem Saliency methods lack reliability when explanations are sensitive to non-contributing factors.
method Used a simple pre-processing step to demonstrate that transformations with no effect on the model can cause misleading attributions.
result Saliency methods that do not satisfy input invariance (mirror model sensitivity to input transformations) result in misleading attributions.
The paper introduces admissible hierarchical clustering methods for asymmetric networks.
problem Characterizing and implementing hierarchical clustering methods for asymmetric networks.
method The paper characterizes admissible hierarchical clustering methods and proposes algorithms for their implementation.
result The paper describes three families of intermediate methods for admissible hierarchical clustering of asymmetric networks.
Medical image reconstruction advances from sparse models to machine learning.
problem Improving image quality and reducing noise in medical imaging.
method Iterative reconstruction, modified data acquisition methods, and machine learning models.
result Machine learning methods show promise in improving image quality.
We propose an optimization method for minimizing the finite sums of smooth convex functions. Our method incorporates an accelerated gradient descent (AGD) and a stochastic variance reduction gradient (SVRG) in a mini-batch setting. Unlike SVRG, our method can be directly applied to non-strongly and strongly convex prob…
R package for counterfactual explanation methods.
problem Lack of unified interfaces for counterfactual explanation methods.
method Developed a modular R6-based interface for three existing counterfactual methods and proposed extensions.
result Comparison of implemented methods' quality and runtime behavior.