New prediction rule for preterm births with high sensitivity and specificity.
problem Difficulty in predicting preterm births accurately.
method Automatically generated and selected interpretable prediction rule from high-dimensional data.
result Simplified prediction rule with 10 items has 62.3% sensitivity and 81.5% specificity.
Statistical inference for misspecified contextual bandits is challenging due to adaptivity issues.
problem Statistical inference for misspecified contextual bandits
method Inverse-probability-weighted Z-estimation framework
result Consistent and asymptotically normal estimator with sandwich variance estimator
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.
Prototype selection improves DS techniques' accuracy and reduces computational cost.
problem Improving the performance of dynamic selection techniques.
method Prototype selection techniques that edit validation data to remove noise and redundant instances.
result Improves DS techniques' classification accuracy and reduces computational cost.
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.
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.
GENESIM creates interpretable models with improved predictive performance.
problem Overfitting in decision trees leads to poor predictive performance and lack of interpretability.
method GENESIM uses a genetic algorithm to transform an ensemble of decision trees into a single interpretable model.
result GENESIM achieves better predictive performance than decision tree induction and ensemble techniques, while maintaining interpretability.
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.
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 …
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.
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.
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.
New properties on null hypersurfaces using rigging technique.
problem Existence and completeness of rigged Riemannian structures on null hypersurfaces.
method Rigging technique to induce Riemannian structure and study geometric/topological properties.
result New properties and applications of rigging fields under geometric/topological constraints.
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.
Explains deep neural networks using new interpretation techniques.
problem Interpreting and understanding deep neural networks.
method Introduces new techniques for interpretation and practical applications.
result Efficient use of interpretation techniques on real data.
This paper reviews resampling techniques to improve classification in imbalanced datasets.
problem Improving classification performance in datasets with class imbalance.
method Review and study of various resampling techniques.
result Effectiveness of resampling techniques on classification performance.
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.
A new ensemble technique improves power forecasting for renewable energy.
problem Improving accuracy in power forecasting for renewable energy.
method Coopetitive soft-gating in a multi-scheme ensemble.
result The technique outperforms other models on publicly available data sets.
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.
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.
New techniques solve robust principal component analysis problems.
problem Robust Principal Component Analysis (RPCA) problems.
method Dual smoothing and level set techniques in convex optimization.
result Numerous theoretical and practical improvements for RPCA.
Techniques for sampling and visualizing generative model latent spaces.
problem Visualizing and sampling latent spaces of generative models.
method Spherical linear interpolation, J-Diagrams, MINE grids, bias-corrected vectors, synthetic vectors, binary classification.
result Improved visualization and sampling techniques for generative models.
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.
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.
Paper explores LSTM visualization techniques for ECGs.
problem Visualizing LSTM models for ECG classification.
method Four visualization techniques applied to ECGs, focusing on input deletion masks.
result Best technique is learning an input deletion mask to reduce class score.
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.
A new data augmentation technique for images improves classification accuracy.
problem Improving image classification accuracy with limited training data.
method SamplePairing: Synthesizing new samples by averaging two randomly chosen images.
result Significant improvement in classification accuracy (e.g., 33.5% to 29.0% for ILSVRC 2012 with GoogLeNet).
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.
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.
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.
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 …
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.
This paper optimizes prediction intervals by tuning Random Forest using meta-validation.
problem Optimizing prediction intervals constructed by Random Forest.
method Combines exhaustive search with meta-validation techniques to tune Random Forest parameters.
result The 75/25 holdout meta-validation technique is always beneficial for tuning Random Forest.
This work characterizes model compression techniques for deep learning on embedded systems.
problem Efficient deep inference on resource-constrained devices.
method Extensive experiments on 11 neural network architectures using data quantization and pruning.
result Opportunities to achieve fast deep inference on embedded systems exist but require careful compression settings.
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.
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…
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…