pystacked combines machine learning models for improved predictions.
problem Improving machine learning model performance through stacking.
method Stacked generalization using Python's scikit-learn with various base learners.
result Enhanced predictive models through combining multiple machine learning algorithms.
The study assesses machine learning generalization using various data set characteristics.
problem Estimating confidence in machine learning predictions and assessing generalization capabilities.
method Meta-analysis of 109 classification data sets, modeling generalization as a function of various characteristics.
result The convex hull of the training data is relevant for assessing machine learning generalization, challenging the common assumption about the curse of dimensionality.
This work evaluates machine learning-based hotspot detectors on synthesized layout patterns.
problem Evaluating model robustness and generality of machine learning-based hotspot detectors.
method Developed an automatic layout generation tool to synthesize various layout patterns and tested machine learning-based detectors on these synthesized layouts.
result Machine learning-based detectors need continuous study for robustness and generality in DFM flows.
Optimal Transport enhances machine learning with new methods.
problem Comparing and manipulating probability distributions in machine learning.
method Probabilistic framework rooted in rich history and theory.
result New solutions in generative modeling and transfer learning.
Private machine learning framework using randomised response.
problem Private machine learning in adversarial environments.
method Randomised response for noisy data release.
result Consistent estimation of true machine learning model.
The paper proposes a method to adapt machine learning models to changing conditions.
problem Machine learning models need to adapt to new conditions in a constantly changing environment.
method Reuse knowledge from existing models to train future generations.
result The proposed method allows machine learning models to adapt and survive in a dynamic environment.
We introduce DQFIM to quantify and improve generalization of quantum machine learning models.
problem Understanding and improving generalization of quantum machine learning models.
method Data quantum Fisher information metric (DQFIM) to quantify circuit parameters and training data.
result Improves generalization by breaking symmetries of training data and using a low number of training states.
NeSS combines neural and symbolic approaches for better compositional generalization.
problem Lack of compositional generalization in deep learning models.
method NeSS uses a neural network to generate traces, executed by a symbolic stack machine with sequence manipulation.
result Achieves 100% generalization performance across multiple domains.
Deep learning models optimize protein sequences.
problem Optimizing protein properties through sequence design.
method Deep generative models guided by machine learning.
result Improved protein sequence generation from prior knowledge.
This note shows how to transform high-probability to in-expectation guarantees in machine learning.
problem The challenge of constructing reliable machine learning models due to sampling randomness.
method Transforming high-probability to in-expectation guarantees using a witness condition for unbounded loss functions.
result A technical transformation method for generalization guarantees in machine learning.
The paper connects optimization and generalization using a new gradient inequality.
problem Connecting optimization dynamics to generalization bounds in machine learning.
method The approach uses the Łojasiewicz gradient inequality to derive convergence rates and generalization bounds.
result The framework provides generalization estimates matching or extending previous results for various models.
This paper aims to incorporate passive symmetries in machine learning for better generalization.
problem Machine learning's reliance on arbitrary choices leads to passive symmetries that can limit generalization.
method Translation among physics, mathematics, and machine learning to understand and implement passive symmetries.
result Respecting passive symmetries can improve machine learning's ability to generalize.
Quantum machine learning boosts drug discovery efficiency.
problem Enhancing drug discovery through quantum computing.
method Quantum neural networks on gate-based quantum computers.
result Significant advancements in molecular property prediction and generation.
New bounds on machine learning model generalization error moments.
problem Understanding the performance of machine learning models.
method Information-theoretic bounds on the moments of the generalization error of learning algorithms.
result Proposed bounds on generalization error moments and their high-probability bounds.
Matched Machine Learning combines machine learning and matching for causal inference.
problem Non-interpretable methods for causal inference.
method Combines machine learning and matching for interpretable causal inference.
result Performs as well as black-box machine learning methods and better than existing matching methods.
This paper uses machine learning to select kernels for machine learning models on various devices.
problem Traditional kernel auto-tuning is limited for machine learning research with changing network topologies and hyperparameters.
method Combines auto-tuning and machine learning to select kernels for SYCL on various devices.
result Initial results show high performance kernel selection with little developer effort.
Our everyday interactions with pervasive systems generate traces that capture various aspects of human behavior and enable machine learning algorithms to extract latent information about users. In this paper, we propose a machine learning interpretability framework that enables users to understand how these generated t…
A theorem for debiasing machine learning with finite sample guarantees.
problem Calculating confidence intervals for machine learning functionals.
method Debiased machine learning based on bias correction and sample splitting.
result Nonasymptotic debiased machine learning theorem with finite sample guarantees.
Probabilistic ML improves healthcare data analysis.
problem Insufficient understanding and incomplete data in healthcare.
method Examination of probabilistic machine learning models for healthcare challenges.
result Probabilistic models enhance healthcare data analysis and model building.
R package for machine learning in survival analysis.
problem Limited machine learning interfaces for survival analysis.
method Provides a comprehensive machine learning interface for survival analysis.
result Systematic infrastructure for survival modeling and evaluation.
This thesis tackles causality in machine learning, improving OOD generalization and robustness.
problem Machine learning struggles with OOD generalization and robustness due to lack of causality modeling.
method Exploits the principle of independent causal mechanisms (ICM) to ensure conditional distribution invariance under distribution shifts.
result Demonstrates how incorporating causality can enhance machine learning's OOD generalization, interpretability, and robustness.
GAMA is a user-friendly AutoML system for machine learning pipeline optimization.
problem Empowering users to control and optimize machine learning pipelines.
method Modular AutoML system with three search algorithms and two post-processing steps.
result GAMA allows users to track and control the search process for optimal machine learning pipelines.
Paper benchmarks machine learning for detecting process curve drifts.
problem Detecting drifts in multivariate manufacturing process data.
method Synthetic data generation and evaluation score introduction.
result Existing algorithms often fail with complex drift scenarios.
Study explores bias-variance in adversarial machine learning.
problem Understanding adversarial machine learning's impact on bias and variance.
method Investigates bias-variance trade-offs in deep neural networks using MSE and cross-entropy.
result Derives bias-variance trade-offs for classification and regression.
Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine learning algorithms. We describe a generic mathematical model to leverage quantum…
This paper studies adversarial examples in NIDS, revealing their vulnerability.
problem Vulnerability of machine learning-based NIDS to adversarial examples.
method Used evolutionary computation and deep learning to generate adversarial examples.
result Adversarial examples cause high misclassification rates in various machine learning models.
Boltzmann machines are physics informed generative models with wide applications in machine learning. They can learn the probability distribution from an input dataset and generate new samples accordingly. Applying them back to physics, the Boltzmann machines are ideal recommender systems to accelerate Monte Carlo simu…
A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where quantum computer may offer significant speedup. Several quantum algorithms for discr…
ELM speeds up financial machine learning tasks.
problem Efficiently solving time-sensitive financial tasks with machine learning.
method Single-layer neural networks with random initialization and convex optimization.
result ELM achieves significant computational efficiency in financial applications.
Graph machine learning lacks a balanced theory, focusing on expressive power and optimization.
problem Insufficient theoretical understanding of GNNs' generalization behavior.
method Develop a balanced theory focusing on expressive power, generalization, and optimization.
result Theoretical advancements need to align with practical success in graph machine learning.
New models improve machine learning accuracy and transparency in finance.
problem Black-box machine learning models lack interpretability in regulated industries.
method Introducing generalized groves of neural additive models with clear feature categories and interactions.
result Generalized groves of neural additive models achieve high accuracy with predominantly linear and sparse nonlinear components.
Lecture note for data science students on machine learning basics and advanced topics.
problem No specific problem stated; preparing students for advanced machine learning.
method Introduction of basic machine learning concepts and advanced topics.
result Students are prepared to study advanced machine learning topics.
The paper connects three machine learning methods to reduce generalization errors.
problem Reducing generalization errors in machine learning models.
method Distributionally robust optimization, Bayesian methods, and regularization.
result Machine learning models can be characterized using distributional uncertainty and robustness measures.
Study on AutoML robustness with dirty data.
problem Robustness of AutoML-generated pipelines with noisy data.
method Investigated TPOT, H2O, and AutoKeras systems; analyzed accuracy and pipeline structure.
result Dirty data can improve robustness of AutoML solutions.
Study proposes local effective dimension to measure model capacity and generalization error.
problem Capturing the generalization power of machine learning models.
method Proposes local effective dimension as a capacity measure.
result Local effective dimension bounds the generalization error and correlates well with it.
Cross-validation is the workhorse of modern applied statistics and machine learning, as it provides a principled framework for selecting the model that maximizes generalization performance. In this paper, we show that the cross-validation risk is differentiable with respect to the hyperparameters and training data for …
This paper tackles nonsmooth optimization in machine learning.
problem Nonsmoothness in machine learning optimization problems.
method Identifying specific structures and leveraging them for practical applications.
result Compression, acceleration, and dimension reduction are possible with nonsmooth optimization.
Teaches uncertainty in ML through practical examples.
problem Lack of uncertainty teaching in ML curricula.
method Developed a curriculum and use cases.
result Motivates adoption of uncertainty concepts in AI courses.
Quantum correlations enhance generative models, providing a new resource for machine learning.
problem Capturing complex probability distributions in unsupervised learning.
method Theoretical and numerical analysis of quantum correlations in generative models.
result Quantum nonlocality and contextuality provide an expressivity advantage over classical models.
Study examines explainable machine learning for monotonic models, finding Integrated gradients better for strong monotonicity.
problem Applying explainable machine learning to science-informed models.
method Proposed axioms for monotonicity, tested Shapley value and Integrated gradients methods.
result Integrated gradients provides better explanations for strong monotonicity.
The paper connects machine learning interpretability with learning theory.
problem Performance and explanation generalization in local machine learning models.
method Theoretical analysis and empirical validation of local approximation explanations.
result Theoretical bounds on test-time accuracy and explanation generalization.
Survey on principles and challenges of interpretable machine learning.
problem Improving machine learning models' interpretability for high-stakes decisions.
method Identification and analysis of 10 technical challenges in interpretable machine learning.
result Identification of 10 technical challenges in interpretable machine learning.
Invariant polynomials improve machine learning performance.
problem Improving machine learning algorithms using invariant polynomials.
method Developed and implemented Lorentz- and permutation-invariant polynomial generators in neural networks.
result Reduction in loss on training and validation data with Hironaka decompositions.
Deep learning models detect nanopore translocation events with high accuracy.
problem Manual parameter selection for nanopore signal analysis is prone to error.
method Developed a synthetic signal generator for training ML models.
result Deep learning models achieve over 99% true event detection.
DisCoPyro combines category theory with machine learning for program learning.
problem Applying category theory to machine learning tasks.
method Introducing DisCoPyro, a framework combining categorical structures with amortized variational inference.
result DisCoPyro can be applied in program learning for variational autoencoders and potentially contributes to AGI.
Our team of dance artists, physicists, and machine learning researchers has collectively developed several original, configurable machine-learning tools to generate novel sequences of choreography as well as tunable variations on input choreographic sequences. We use recurrent neural network and autoencoder architectur…
The paper provides a method to find optimal machine learning model parameters with confidence.
problem Finding optimal machine learning model parameters that generalize well to the entire population.
method Constructs valid confidence sets for the optimal parameter using only training data.
result Valid confidence sets for optimal machine learning model parameters can be generated using bootstrapping techniques.
New Physics Learning Machine compares generative models for scientific research.
problem Evaluating the fidelity of generative models in high-energy physics.
method Two-sample hypothesis testing using machine learning.
result The New Physics Learning Machine outperforms alternative approaches in classification-based tests.