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.
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.
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. 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.
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.
Study finds different active learning techniques better for various learning objectives.
problem Matching active learning techniques to specific learning objectives.
method Survey of students' perceptions and ratings of various techniques.
result Different active learning techniques are best suited for different learning objectives.
Enhanced Bayesian target encoding uses sampling techniques to improve model performance.
problem Improving target encoding for better model performance in machine learning.
method Using sampling techniques in Bayesian target encoding to extract intra-category distribution information.
result Improves generalization and reduces target leakage in machine learning models.
In dynamic selection (DS) techniques, only the most competent classifiers, for the classification of a specific test sample are selected to predict the sample's class labels. The more important step in DES techniques is estimating the competence of the base classifiers for the classification of each specific test sampl…
Adapts pivoting technique to circle homeomorphisms for proofs.
problem Probabilistic Tits alternative and exponential synchronization.
method Adapts Gou{ë}zel's pivoting technique.
result Different proofs of probabilistic Tits alternative and exponential synchronization.
This review covers AI in finance, challenges, techniques, and opportunities.
problem Challenges and opportunities in AI applications in finance.
method Comprehensive categorization and overview of AI research in finance over decades.
result A dense roadmap of AI challenges, techniques, and opportunities in finance.
Survey of extreme value modeling techniques for insurance.
problem Modeling of insurance industry's extreme events.
method Truncation, tempering, censoring, regression techniques.
result Adapted techniques for insurance applications.
This article is written for the Proceedings of the Conference on Current Developments in Mathematics in Harvard University, November 16-17, 2007. It is an exposition of the analytic proof of the finite generation of the canonical ring for a compact complex algebraic manifold of general type. It lists and discusses the …
Framework converts singer identity and vocal technique from non-parallel corpora.
problem Converts singer identity and vocal technique from non-parallel corpora.
method Uses variational autoencoders with separate encoders for singer identity and vocal technique.
result Successfully disentangles and converts singer identity and vocal technique.
New displacement technique vanishes bounded cohomology in all degrees.
problem Vanishing of bounded cohomology in all positive degrees and dual separable coefficients.
method Introducing the property of commuting cyclic conjugates as a new displacement technique.
result Vanishes bounded cohomology in all positive degrees and all dual separable coefficients.
Models obtained by decision tree induction techniques excel in being interpretable.However, they can be prone to overfitting, which results in a low predictive performance. Ensemble techniques are able to achieve a higher accuracy. However, this comes at a cost of losing interpretability of the resulting model. This ma…
Study harmonic mappings and submanifolds using Bochner technique.
problem Classical theorems in harmonic mappings and submanifolds.
method Generalized Bochner technique.
result New insights into classical theorems.
Overview of SML techniques with banking applications.
problem Credit risk modeling in banking.
method Tree-based ensemble algorithms, Feedforward NNs, hyper-parameter optimization, machine learning interpretability.
result Comparison of ML algorithm features and their application in banking.
Reduces survival analysis to common regression tasks.
problem Applying standard machine learning tools to survival analysis.
method Various reduction techniques to simplify survival analysis.
result Benchmark analysis shows improved predictive performance.
This study reviews techniques to estimate volatility and price Variance Swaps.
problem Estimating historical volatility and pricing Variance Swaps.
method Review of existing techniques.
result Discussion of various methods to estimate volatility and price Variance Swaps.
New methods show hyperbolicity of Brunnian links.
problem Determining hyperbolicity of Brunnian links.
method Geometric/combinatorial topology techniques applied to links with at least one unknotted component.
result Determine hyperbolicity for all Brunnian links.
This review explores resampling techniques for imbalanced binary classification.
problem Imbalanced classes lead to poor prediction results in classification.
method Classical, cost-sensitive, and Neyman-Pearson paradigms with resampling techniques and classification methods.
result Complex dynamics among resampling techniques, base methods, metrics, and imbalance ratios.
Broad adoption of machine learning techniques has increased privacy concerns for models trained on sensitive data such as medical records. Existing techniques for training differentially private (DP) models give rigorous privacy guarantees, but applying these techniques to neural networks can severely degrade model per…
Paper proposes a black-box technique to generate adversarial samples.
problem Robustness of Deep Neural Networks (DNNs) to adversarial samples.
method Black-box Momentum Iterative Fast Gradient Sign Method (BMI-FGSM) using Differential Evolution to approximate gradients.
result Achieves high success rates in generating adversarial samples and misclassification.
The pursuit of explaining and improving generalization in deep learning has elicited efforts both in regularization techniques as well as visualization techniques of the loss surface geometry. The latter is related to the intuition prevalent in the community that flatter local optima leads to lower generalization error…
New technique reduces FRTB IMA capital calculation burden by over 90%.
problem Reduction of computational burden in FRTB IMA capital calculation.
method Orthogonal Chebyshev Sliding Technique based on high-dimensional Chebyshev Tensors.
result Reduction of computational burden by more than 90%.
New Bochner technique for foliations with non-negative Ricci curvature.
problem Analyzing foliations with non-negative transverse Ricci curvature.
method Generalizing Bochner technique to foliations with non-negative transverse Ricci curvature.
result Obtained a new vanishing theorem for basic cohomology.
Various stochastic models have been proposed to estimate mortality rates. In this paper we illustrate how machine learning techniques allow us to analyze the quality of such mortality models. In addition, we present how these techniques can be used for differentiating the different causes of death in mortality modeling…
In machine learning, a nonparametric forecasting algorithm for time series data has been proposed, called the kernel spectral hidden Markov model (KSHMM). In this paper, we propose a technique for short-term wind-speed prediction based on KSHMM. We numerically compared the performance of our KSHMM-based forecasting tec…
Vanishing theorem on CR manifolds with non-negative curvature.
problem Vanishing theorem for Betti numbers on CR manifolds.
method Application of Bochner technique to CR manifolds with non-negative curvature.
result Proof of vanishing theorem for Betti numbers.
This paper compares traditional econometric and contemporary machine/deep learning techniques for forecasting foreign exchange rates.
problem Accurate prediction of foreign exchange rates for investment purposes.
method Multivariate time series analysis using Vector Auto Regression, Support Vector Machine, and Recurrent Neural Networks.
result Contemporary machine/deep learning techniques outperform traditional econometric methods in forecasting foreign exchange rates.
Abstract notes on generative modeling techniques.
problem Improving generative modeling techniques.
method Connections between optimal transport and Schrödinger bridge, flow matching.
result Showed connections between mathematical principles and generative modeling techniques.
In this article, we propose a novel ensemble technique with a multi-scheme weighting based on a technique called coopetitive soft gating. This technique combines both, ensemble member competition and cooperation, in order to maximize the overall forecasting accuracy of the ensemble. The proposed algorithm combines the …
Screening is an effective technique for speeding up the training process of a sparse learning model by removing the features that are guaranteed to be inactive the process. In this paper, we present a efficient screening technique for sparse support vector machine based on variational inequality. The technique is both …
In recent era prediction of enzyme class from an unknown protein is one of the challenging tasks in bioinformatics. Day to day the number of proteins is increases as result the prediction of enzyme class gives a new opportunity to bioinformatics scholars. The prime objective of this article is to implement the machine …
Two retraining techniques outperform fine-tuning in neural network pruning.
problem Improving accuracy and compression in neural network pruning.
method Weight rewinding and learning rate rewinding compared to fine-tuning.
result Rewinding techniques outperform fine-tuning in accuracy and compression.
This paper examines feature selection for extracting user intentions from Twitter.
problem Extracting user intentions from informal, misspelled tweets.
method Developed a dataset from Twitter feeds, used two feature selection techniques (Information Gain and hybrid forward selection), and applied four classification algorithms.
result The hybrid feature selection approach outperformed the Information Gain method.
Most of the existing studies on voice conversion (VC) are conducted in acoustically matched conditions between source and target signal. However, the robustness of VC methods in presence of mismatch remains unknown. In this paper, we report a comparative analysis of different VC techniques under mismatched conditions. …
Paper adapts Getzler's grading technique for new applications.
problem Computing leading terms of asymptotic expansions of traces of heat kernels.
method Adapting Getzler's grading technique to two new contexts.
result Adapted technique yields leading terms of asymptotic expansions.
We develop a technique for deriving data-dependent error bounds for transductive learning algorithms based on transductive Rademacher complexity. Our technique is based on a novel general error bound for transduction in terms of transductive Rademacher complexity, together with a novel bounding technique for Rademacher…
The performance of classification algorithms with a massive and highly imbalanced data stream depends upon efficient balancing strategy. Some techniques of balancing strategy have been applied in the past with Batch data to resolve the class imbalance problem. This paper proposes a new incremental data balancing framew…