New metrics solve machine learning limitations.
problem Previous success metrics restrict application to specific forms of machine learning.
method Define decomposable metrics as linear operations on probability distributions.
result Demonstrated theorems bounding success in various ways, generalizing existing results.
Machine learning predicts TV show success based on factors like characters and direction.
problem Predicting the success of TV shows in a competitive market.
method Descriptive and predictive modeling using machine learning.
result Shows with strong characters and good direction tend to be more successful.
Predicting startup success using Crunchbase data and deep learning.
problem Predicting startup success in a volatile entrepreneurial ecosystem.
method Novel deep learning model integrating funding metrics, founder features, and industry category.
result Achieved 14 times capital growth and identified high-potential startups.
Vanguard uses AI to create personalized financial plans.
problem Challenges in choosing features for complex financial planning.
method Reinforcement learning for identifying optimal savings rates.
result Trains algorithms to model financial success trajectories.
Paper uses nearest neighbor method to predict exam success based on online test trends.
problem Predicting student success/failure in final exams.
method Applied nearest neighbor method to estimate student learning skill from online test trends.
result Improved prediction accuracy for exam success/failure.
MeRL learns from sparse, underspecified rewards by discounting spurious trajectories.
problem Learning from binary success-failure feedback with little context.
method MeRL uses KL divergence to collect diverse successful trajectories and optimize an auxiliary reward function.
result MeRL outperforms alternative reward learning techniques and achieves state-of-the-art performance.
PixelHop uses SSL for image classification, outperforming CNN.
problem Image classification accuracy improvement.
method PixelHop combines SSL with supervised and unsupervised dimension reduction.
result PixelHop outperforms CNN on MNIST, Fashion MNIST, and CIFAR-10 datasets.
New bounds on AE success probability in GP models.
problem Limiting the success of adversarial examples in probabilistic models.
method Investigated upper bounds on AE success probability using Gaussian Processes.
result Proved a new upper bound of AE success probability dependent on perturbation norm, kernel function, and training dataset distance.
Bias is essential for machine learning success, quantifiable and conserved.
problem The necessity and quantification of bias in machine learning success.
method Quantifying bias relative to possible datasets and demonstrating its role in increasing success probability.
result Bias is a conserved quantity and essential for favorably biasing towards a fixed target.
This paper characterizes adversarial examples in deep learning.
problem Security threats posed by adversarial attacks in deep learning systems.
method Statistical characterization of adversarial examples, easy and hard categorization of attacks, extensive experimental study.
result Adversarial attacks behave differently under different hyperparameters and frameworks.
This study analyzes counterfactual explanations for student success models.
problem Improving trust in machine learning models for student success prediction.
method Comparison of counterfactual generation methods (WhatIf, Multi-Objective, Nearest Instance) for student success prediction models.
result WhatIf Counterfactual Explanations are more effective for student success prediction models.
Paper proposes a new method for training nonconvex models.
problem Training nonconvex models like neural networks.
method Successive functional gradient optimization using mirror descent in a function space.
result The method leads to better performance than standard training techniques.
Proposes SOR Q-learning for faster optimal value function computation in RL.
problem Finding optimal value function in Markov Decision Processes (MDPs).
method Successive Over-Relaxation (SOR) applied to Q-learning algorithm.
result SOR Q-learning converges faster to optimal value function compared to standard Q-learning.
Proposes a deep latent factor model for better recommendation systems.
problem Improving collaborative filtering in recommendation systems.
method Introduces a deeper latent factor model using deep learning.
result Significantly outperforms state-of-the-art techniques in experiments.
Proposes a new framework to manage venture capital portfolio risk by focusing on deal-level correlations.
problem Managing venture capital portfolio risk, especially extreme outcomes.
method Gaussian-copula-based framework that learns deal-level dependence from observed joint success frequencies.
result Correlation amplifies extreme upside outcomes, shifting portfolio distribution toward heavier right tails.
PixelHop++ improves image classification with a smaller model size.
problem Improving image classification models with smaller sizes.
method Decomposing input tensor, channel-wise Saab transform, successive subspace learning, feature ranking.
result PixelHop++ offers a flexible tradeoff between model size and performance.
Proposes a deep learning framework guided by human advice.
problem Learning from sparse and noisy data.
method Knowledge-augmented Column Networks, leveraging human advice.
result Improves model performance in domains with structured representations.
Many machine learning (ML) approaches are widely used to generate bioclimatic models for prediction of geographic range of organism as a function of climate. Applications such as prediction of range shift in organism, range of invasive species influenced by climate change are important parameters in understanding the i…
New learning algorithm mimics biological neural networks.
problem Biologically implausible backpropagation for directed neural networks.
method Introduces new neuronal dynamics and learning rule for arbitrary architectures, sparsity-inducing pruning method, and dynamical-systems characterization.
result Prunes irrelevant connections and improves learning efficiency.
Deep learning mimics successful traders in financial markets.
problem Tackling profitable trading behavior in financial markets.
method Using deep learning neural networks to replicate adaptive trading behavior.
result Deep learning can outperform human traders and even improve performance.
Study shows startup competition and investor network influence fundraising success at different stages.
problem Misunderstanding of fundraising success factors across startup stages.
method Used Word2Vec for competition measures and Graph Neural Networks for investor network analysis.
result Startup competition is crucial for early-stage fundraising, while growth-stage fundraising is influenced by investor network features.
Transforming sparse outcomes into dense process rewards for efficient reinforcement learning.
problem Training RL policies to maximize sparse outcomes.
method Incentivizing policy matching state-action visitations of successful episodes.
result Significantly faster RL finetuning performance.
New method generates fast adversarial faces with high success rate.
problem Vulnerability of face recognition systems to adversarial attacks.
method Fast landmark manipulation method and semantic structure constrained attack.
result 99.86% success rate on state-of-the-art face recognition models.
Recent unsupervised representation learning methods maximize mutual information, but their success depends on architecture and estimator inductive biases.
problem Estimating mutual information is hard, and MI maximization can lead to entangled representations.
method The paper argues that the success of mutual information maximization methods depends on the choice of feature extractor architectures and the parametrization of MI estimators.
result The paper provides empirical evidence that the success of mutual information maximization methods is not solely due to MI properties.
Deep learning is a broad set of techniques that uses multiple layers of representation to automatically learn relevant features directly from structured data. Recently, such techniques have yielded record-breaking results on a diverse set of difficult machine learning tasks in computer vision, speech recognition, and n…
Paper learns domain randomization distributions for robust robot policies.
problem Finding good domain randomization parameters for simulation without real data.
method Gradient-based search methods to learn domain randomization distribution.
result Improvements in jump-start and asymptotic performance when transferring policies.
Two approaches improve parameter learning in various mixture models.
problem Parameter learning in mixture models.
method Complex-analytic and algebraic-combinatorial methods.
result Improved sample sufficiency for parameter estimation in specific mixture models.
DG separates successes and failures by gating updates with advantage and surprisal.
problem Negative learning from surprising data in distributed reinforcement learning.
method DG gates each update with the product of advantage and surprisal, suppressing failures and preserving successes.
result DG outperforms other methods in various challenging reinforcement learning tasks.
Study on information evolution in interactive decision making using multi-armed bandits.
problem Understanding information dynamics in interactive decision making.
method Stochastic multi-armed bandit problem, focusing on optimal arm with a fixed margin.
result Distinct growth phases in mutual information, showing decoupling between success probability and information gain.
The paper proposes a method to reliably select design algorithms for machine learning-guided design tasks.
problem Choosing the right design algorithm for machine learning-guided design tasks.
method Combining designs' predicted property values with held-out labeled data to reliably forecast characteristics of the label distributions produced by different design algorithms.
result The method is guaranteed to return design algorithms that yield successful label distributions.
The paper explores high-dimensional learning in finance, proving key aspects and setting lower bounds.
problem Understanding when and how large, over-parameterized models achieve predictive success in finance.
method Theoretical foundations and empirical validation of two key aspects: standardization and information-theoretic lower bounds.
result Empirical validation shows that high-dimensional learning in finance often relies on lower-complexity artefacts rather than the intended mechanism.
GRPO optimizes LLMs with verifiable rewards, amplifying policy success.
problem Improving LLMs' reasoning under verifiable binary rewards.
method Introduces GRPO, analyzes variants of reward normalization and regularization.
result GRPO amplifies policy success, converging to a fixed point exceeding the reference.
This study examines how learning algorithms affect collective action in machine learning.
problem The impact of collective action on machine learning is limited when not considering the choice of learning algorithms.
method Focuses on distributionally robust optimization and stochastic gradient descent, analyzing their effects on collective success.
result The choice of learning algorithm significantly impacts the effective size and success of a collective in machine learning.
Model explains Netflix Prize success with structured correlation.
problem Understanding structured correlation in high-dimensional data.
method Developed a new statistical learning model.
result Characterized learnability in terms of VCN k , k {}_{k,k} k , k -dimension. Paper analyzes self-supervised learning using causal methods and proposes a new objective.
problem Lack of theoretical understanding of self-supervised learning success.
method Uses a causal framework to enforce invariance constraints on proxy classifiers.
result ReLIC objective improves generalization guarantees and outperforms existing methods.
Learning by children and animals occurs effortlessly and largely without obvious supervision. Successes in automating supervised learning have not translated to the more ambiguous realm of unsupervised learning where goals and labels are not provided. Barlow (1961) suggested that the signal that brains leverage for uns…
Filtering data with a pre-trained model improves multimodal contrastive learning performance.
problem Improving the quality of internet-scale multimodal datasets.
method Characterized the performance of filtered contrastive learning under a bimodal data generation model.
result Data filtering using a pre-trained model reduces contrastive learning error by a factor of η \sqrt{η} η in the large η η η regime. Unified framework for multi-view learning with orthogonal projections.
problem Learning individual orthogonal projections for multiple views.
method Successive approximations via eigenvectors, iterative Krylov subspace method.
result Consistently competitive and often better than existing methods.
Luck is crucial for success, talent alone isn't enough.
problem The role of luck and talent in achieving success.
method Agent-based model to simulate the role of luck and talent.
result Luck is more important than talent for success.
Meta-learning improves hyperparameter tuning for XGBoost.
problem Improving hyperparameter tuning for XGBoost models.
method Proposed MeSH algorithm using meta-regressors to guide hyperparameter selection.
result MeSH often finds superior hyperparameter configurations compared to SH and random search.
Extends positive and almost positive links to successively almost positive ones.
problem Extending properties of positive and almost positive diagrams and links.
method Introducing successively almost positive diagrams and links, and analyzing their properties.
result Improves known results of positive and almost positive links.
Student-teacher learning improves generalization with noisy inputs.
problem Transfer knowledge from clean inputs to noisy inputs.
method Analyzes student-teacher learning using deep linear networks and experiments with nonlinear networks.
result Three factors are vital for success: zero training loss, teacher knowledge, and feature decomposition.
Success conditioning optimizes policies by imitating successful trajectories, solving a trust-region optimization problem.
problem Improving policies through random actions that lead to desired outcomes.
method Success conditioning, which involves collecting and updating policies based on successful trajectories.
result Success conditioning solves a trust-region optimization problem, maximizing policy improvement with a χ 2 χ^2 χ 2 divergence constraint. Quantum circuits are hard to learn on average.
problem Learning the output distributions of quantum circuits is hard.
method Statistical query model analysis.
result Learning quantum circuits requires exponentially many queries.
QT-Opt learns dynamic grasping strategies for robots.
problem Learning dynamic grasping for robots in real-world settings.
method Scalable self-supervised vision-based reinforcement learning.
result 96% grasp success on unseen objects with real-world learning.
Paper predicts M&A deal success using ML and DL techniques.
problem Predicting the success of M&A deals to avoid costly mistakes.
method Data preprocessing with ML techniques, feedforward neural networks, and sentiment scores integration.
result Methodology outperforms benchmark models in preliminary tests.
SSL framework identifies non-linear systems without labeled data.
problem System identification in non-linear environments without labeled data.
method Dynamics contrastive learning framework.
result SSL can identify non-linear dynamics in latent space.
Biological datasets amenable to applied machine learning are more available today than ever before, yet they lack adequate representation in the Data-for-Good community. Here we present a work in progress case study performing analysis on antimicrobial resistance (AMR) using standard ensemble machine learning technique…