A new method for instance segmentation using a single network.
problem Precisely detecting and delineating objects in images.
method Proposes a solution based on DCME technique, using a single segmentation network.
result Reduces computational cost by repurposing the network encoder for classification.
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.
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.
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 …
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.
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.
This paper proposes neural network-based undersampling techniques to improve model performance on class-imbalanced datasets.
problem Class imbalance problem in machine learning models leads to biased predictions and lower performance metrics.
method Neural network-based undersampling techniques applied to class-imbalanced datasets.
result Neural network-based undersampling outperforms other resampling techniques in terms of AUC, F1, and G-mean scores.
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…
Article compares different machine learning techniques for protein classification.
problem Predicting enzyme class from unknown proteins is challenging.
method Implemented seven classification techniques on 4368 protein data.
result C5.0 classification technique gives highest accuracy and balanced performance.
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…
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.
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 thesis explores adaptive sampling techniques for creating efficient surrogate models.
problem High computational cost of numerical simulations.
method Adaptive sampling techniques for Kriging metamodels.
result Comprehensive comparison of adaptive sampling techniques for Kriging.
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 …
This study evaluates data pre-processing techniques for class imbalance in biomedical data.
problem Class imbalance in biomedical datasets affects model performance.
method Resampling and feature selection techniques evaluated using SVM, C4.5, LDA, and KNN classifiers.
result Feature Selection outperforms other methods in most cases, especially with SVM.
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 …
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.
Compact SE models are created with PP and PQ techniques, reducing size by 10.03%.
problem Balancing denoising performance and computational cost in SE models.
method Parameter pruning and quantization techniques integrated for compactness.
result 10.03% reduction in model size with minor performance losses.
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…
Improved DP models with active learning on public data.
problem Differentially private models trained on sensitive data degrade performance.
method Fine-tuning DP models through active learning on public data.
result Improved accuracy for DP models while maintaining privacy guarantees.
The twisting technique creates infinite links.
problem Creating infinite links from given ones.
method Applying the twisting technique to adequate, homogeneous, or alternative links.
result These three classes of links are infinite.
New findings suggest adversarial training does not flatten loss landscapes, challenging current intuition.
problem Understanding and improving generalization in deep learning.
method Loss surface visualization with filter normalization technique.
result Adversarial training does not result in flatter loss landscapes, challenging current intuition.
Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters K, we use three stages to find a clustering. The first stage uses a hybrid clustering technique to produce a series of clusterings of various sizes (randomly se…
Data augmentation is a widely used technique in many machine learning tasks, such as image classification, to virtually enlarge the training dataset size and avoid overfitting. Traditional data augmentation techniques for image classification tasks create new samples from the original training data by, for example, fli…
Explains Thurston geometries and visualization techniques.
problem Classifying Thurston geometries and their visualization.
method Survey of history and recent techniques.
result Discussion of recent immersive visualization techniques.
Deep learning aids in autism diagnosis and rehabilitation using neuroimaging data.
problem Challenges in automated detection and rehabilitation of ASD using neuroimaging data.
method Deep learning techniques applied to neuroimaging data for ASD diagnosis and rehabilitation.
result Deep learning improves accuracy in ASD diagnosis and rehabilitation.
Recent studies have shown that tuning prediction models increases prediction accuracy and that Random Forest can be used to construct prediction intervals. However, to our best knowledge, no study has investigated the need to, and the manner in which one can, tune Random Forest for optimizing prediction intervals { thi…
The recent advances in deep neural networks (DNNs) make them attractive for embedded systems. However, it can take a long time for DNNs to make an inference on resource-constrained computing devices. Model compression techniques can address the computation issue of deep inference on embedded devices. This technique is …
We introduce several techniques for sampling and visualizing the latent spaces of generative models. Replacing linear interpolation with spherical linear interpolation prevents diverging from a model's prior distribution and produces sharper samples. J-Diagrams and MINE grids are introduced as visualizations of manifol…
New technique for multiple-source adaptation without density estimation.
problem Multiple-source adaptation problem.
method Discriminative technique that uses conditional probabilities from unlabeled data.
result Our technique outperforms previous generative solutions and other domain adaptation baselines.