Estimates complex Hessian integral for complex Monge-Ampère equations.
problem Improving classical ABP estimate for complex settings.
method De Giorgi iteration method for complex Monge-Ampère equations.
result Sharp gradient estimates for complex Monge-Ampère equations.
This paper explains a technique for proving geometric inequalities.
problem Proving various geometric inequalities in different contexts.
method Unified framework based on Alexandrov-Bakelman-Pucci technique.
result Unified approach to proving geometric inequalities.
The ABP method is used to prove geometric inequalities for submanifolds and tensors.
problem Establishing geometric inequalities for submanifolds and tensors.
method Application of the Alexandrov-Bakelman-Pucci (ABP) method.
result Logarithmic Sobolev inequality and Sobolev-type inequality for submanifolds and tensors.
New proof of Kähler-Einstein Fano manifold L∞ estimates.
problem Uniform L∞ estimates for Kähler-Ricci flow on Kähler-Einstein Fano manifolds. method Using Chen-Cheng's auxiliary Monge-Ampère equation and the Alexandrov-Bakelman-Pucci maximum principle, without pluripotential theory.
result Uniform L∞ estimates derived for Kähler-Ricci flow on Kähler-Einstein Fano manifolds. Proves new Sobolev inequalities for submanifolds in manifolds with nonnegative intermediate Ricci curvature.
problem Proving Sobolev inequalities for submanifolds in manifolds with nonnegative intermediate Ricci curvature.
method Using the Alexandrov-Bakelman-Pucci method to prove Michael-Simon type inequalities.
result Extends existing inequalities to the k-Ricci curvature setting and provides isoperimetric inequalities. Logarithmic Sobolev inequality proven for non-compact self-shrinkers.
problem Establishing a logarithmic Sobolev inequality for non-compact self-shrinkers.
method Using Alexandrov-Bakelman-Pucci (ABP) method to prove the inequality for Euclidean space, then applying this method to non-compact self-shrinkers.
result Optimal logarithmic Sobolev inequality for complete, non-compact, properly embedded self-shrinkers.
Proves inequalities for tensor fields on submanifolds using ABP method.
problem Proving Michael-Simon inequalities for tensor fields.
method Alexandrov-Bakelman-Pucci (ABP) method
result Proved Michael-Simon inequalities for tensor fields.
Proves inequality for tensor fields on curved spaces.
problem Generalizing inequality for tensor fields on curved spaces.
method Alexandrov-Bakelman-Pucci (ABP) method
result Proves Michael-Simon-Sobolev inequality for tensor fields.
Uniform bounds derived for fully non-linear equations.
problem Bounding fully non-linear equations uniformly in background metrics.
method Auxiliary Monge-Ampère equations and entropy-like quantities.
result Uniform L∞ bounds for systems coupling fully non-linear equations to their linearizations. Gradient estimate proved for Donaldson's equation on Kähler manifolds.
problem Proving gradient estimates for Donaldson's equation on compact Kähler manifolds.
method Using uniform upper bounds for trωχφ and Alexandrov-Bakelman-Pucci (ABP) maximum principle. result Gradient estimate for Donaldson's equation derived from uniform bounds.
On a Riemannian metric-measure space, we establish an Alexandrov-Bakelman-Pucci type measure estimate connecting Bakry-Émery Ricci curvature lower bound, modified Laplacian and the measure of certain special sets. We apply this estimate to prove Harnack inequalities for the modified Laplacian operator and fully non-lin…
Estimates for polynomial operators using determinant majorization and subharmonics.
problem Bounding solutions of polynomial operators on Euclidean domains.
method Combines Alexandrov estimate and determinant majorization, using subharmonics and semiconvex approximation.
result Includes classical Alexandrov-Bakelman-Pucci estimate for linear operators.
The paper proves Michael-Simon inequalities in hyperbolic space using novel curvature flows.
problem Proving the sharp Michael-Simon inequality for mean curvature in hyperbolic space.
method Developed new locally constrained curvature flows for proving the inequality.
result Sharp Michael-Simon inequalities for mean and k-th mean curvatures in starshaped hypersurfaces in hyperbolic space.
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.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…
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.
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.
In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …
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.
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.
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
We investigate methods for pricing American options under the variance gamma model. The variance gamma process is a pure jump process which is constructed by replacing the calendar time by the gamma time in a Brownian motion with drift, which makes it a time-changed Brownian motion. In general, the finite difference me…
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
Geometric methods study 3-manifold splittings.
problem Studying Heegaard splittings of 3-manifolds.
method Geometric approaches.
result Recent advances in geometric methods.
We propose two localized Radial Basis Function (RBF) methods, the Radial Basis Function Partition of Unity method (RBF-PUM) and the Radial Basis Function generated Finite Differences method (RBF-FD), for solving financial derivative pricing problems arising from market models with multiple stochastic factors. We demons…
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.
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.
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…
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.
We evaluate how modern outlier detection methods perform in identifying outliers in e-commerce conversion rate data. Based on the limitations identified, we then present a novel method to detect outliers in e-commerce conversion rate. This unsupervised method is made more business relevant by letting it automatically a…
Spectral methods of moments provide a powerful tool for learning the parameters of latent variable models. Despite their theoretical appeal, the applicability of these methods to real data is still limited due to a lack of robustness to model misspecification. In this paper we present a hierarchical approach to methods…
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…
We discuss the relevance of the recent Machine Learning (ML) literature for economics and econometrics. First we discuss the differences in goals, methods and settings between the ML literature and the traditional econometrics and statistics literatures. Then we discuss some specific methods from the machine learning l…
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.
The field of medical image reconstruction has seen roughly four types of methods. The first type tended to be analytical methods, such as filtered back-projection (FBP) for X-ray computed tomography (CT) and the inverse Fourier transform for magnetic resonance imaging (MRI), based on simple mathematical models for the …
We generalize Newton-type methods for minimizing smooth functions to handle a sum of two convex functions: a smooth function and a nonsmooth function with a simple proximal mapping. We show that the resulting proximal Newton-type methods inherit the desirable convergence behavior of Newton-type methods for minimizing s…
Derives new optimization methods using variational integrators.
problem Optimization methods in machine learning.
method Variational integrators and principles of Hamilton and Lagrange-d'Alembert.
result Derives two families of optimization methods, including Nesterov's accelerated gradient method.
A new method for faster optimization in high dimensions.
problem Slow convergence in high-dimensional optimization problems.
method Subspace cubic regularized Newton method within Krylov subspace.
result Achieves a dimension-independent convergence rate of O(1/mk + 1/k^2).
We discuss various analytic and numerical methods that have been used to get option prices within a framework of the VG model. We show that some popular methods, for instance, Carr-Madan's FFT method could blow up for certain values of the model parameters even for an European vanilla option. Alternative methods - one …
This paper provides mathematical foundations for regression methods used in forward initial margin approximation.
problem Developing robust methods for approximating forward initial margin.
method Introduces mathematical rigor to show that regression methods are variations of approximating the conditional expectation function.
result Each regression method is a numerical estimation of the conditional expectation with a different functional form.
The article derives a formula for predicting claims uncertainty using the GCC method.
problem Claims reserving uncertainty in non-life insurance modeling.
method Generalized Cape Cod (GCC) method, derived an analytical formula for MSEP.
result Derives an analytical formula for the mean squared error of prediction (MSEP) of the GCC method.