The paper analyzes why the median heuristic works well in kernel methods.
problem Lack of theoretical understanding of the median heuristic's effectiveness.
method Convergence analysis and empirical investigations of kernel two-sample test.
result The median heuristic leads to asymptotic normality of bandwidth in kernel two-sample test.
A heuristic framework tests the multi-manifold hypothesis in empirical data.
problem Overestimation of parameters in global linear models.
method Heuristic multiscale framework using spline-interpolated manifolds.
result Validates the multi-manifold hypothesis in empirical data.
Optimal testing framework for many experiments with costly observations.
problem Optimal testing in scenarios with many hypotheses and limited observations.
method Characterized and computed the optimal policy for sampling experiments, developed a heuristic.
result High-powered classical tests can be inefficient in the experiment-rich regime.
A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.
problem Optimizing input parameters for stochastic simulation-based optimization.
method Reactive sample size algorithm based on parametric tests and indifference-zone selection.
result The reactive method improves efficiency and robustness of heuristic optimization techniques.
Interactive weak supervision learns useful heuristics from user feedback.
problem Creating useful heuristics for large labeled datasets is tedious and subjective.
method Develops an interactive framework for learning heuristics from user feedback.
result Only a few feedback iterations are needed to train models without ground truth labels.
Deep RL optimizes lab test scheduling for better patient outcomes and cost savings.
problem Redundant lab tests lead to cost and patient discomfort.
method Deep reinforcement learning for optimal scheduling.
result Deep RL policy outperforms heuristic scheduling in both accuracy and cost.
Recently two search algorithms, A* and breadth-first branch and bound (BFBnB), were developed based on a simple admissible heuristic for learning Bayesian network structures that optimize a scoring function. The heuristic represents a relaxation of the learning problem such that each variable chooses optimal parents in…
GE finds failures in autonomous systems without domain heuristics.
problem Finding failures in autonomous systems without domain-specific heuristics.
method Adaptive stress testing using go-explore (GE) algorithm.
result GE finds failures in scenarios other RL techniques cannot solve.
A very simple heuristic approach to the unfolding problem will be described. An iterative algorithm starts with an empty histogram and every iteration aims to add one entry to this histogram. The entry to be added is selected according to a criteria which includes a χ2 test and a regularization. After a relatively s…
A new clustering method combines Kalman filtering with K-Means for better results.
problem Improving clustering efficiency and accuracy in data mining.
method Proposes a new clustering algorithm (HKA-K) that integrates Kalman filtering and K-Means.
result HKA-K outperforms other hybrid meta-heuristic clustering approaches on UCI datasets.
Two heuristics solve dynamic multiple travelling salesmen problems.
problem Dynamic routing with unknown customers.
method Balanced dynamic closest vehicle heuristic and balanced dynamic assignment vehicle heuristic.
result Continuous approximation models for strategic dynamic routing.
Graphical heuristic reduces and partitions large datasets for faster supervised training.
problem Training large datasets for classification tasks.
method Clustering and information graph construction for dataset reduction and partitioning.
result Significant speed-up in training run-time without compromising prediction accuracy.
Machine learning predicts ECHR judgments on human rights violations.
problem Predicting the outcome of ECHR judgments on human rights violations.
method Auto-sklearn for model selection, N-grams, word embeddings, doc2vec, echr2vec for feature extraction, cross-validation for accuracy assessment.
result Features from echr2vec embedding provided the highest cross-validation accuracy for 5 Articles, overall test accuracy was 68.83%.
New test assesses reliability of auto-generated features.
problem Lack of reliable assessment for auto-generated features.
method Selective inference framework for statistical testing.
result Proposes a statistical test for auto-generated features in linear models.
Extends knockoff filter for composite null hypotheses in variable selection.
problem Handling composite null hypotheses in variable selection.
method Developed two methods for composite inference with knockoffs: S-OLS and FRPP.
result Proposed heuristic variants of S-OLS outperforming BH procedure for composite nulls.
AutoGMM automates Gaussian mixture modeling in Python.
problem Automatic clustering of complex data with uncertainty-aware grouping.
method Strategic initialization using an agglomerative Mahalanobis heuristic, parallelized model selection by information criteria.
result Strong out-of-the-box performance on classic benchmarks and real datasets.
New method tests independence and learns graphs without manual choices.
problem Testing independence of multivariate random variables is hard.
method Link between independence testing and supervised learning.
result Predictive independence tests outperform current methods.
Paper optimizes hypothesis verification in sequential experiments.
problem Maximizing confidence in a verified hypothesis after exploration.
method Formulated as a confidence maximization problem in a POMDP, characterized optimal solutions, and proposed a heuristic.
result Heuristic performs better than existing methods in some scenarios.
Data mining enhances a heuristic for the Minimum Latency Problem.
problem Finding optimal solutions for the Minimum Latency Problem efficiently.
method Combining GRASP with data mining to find frequent patterns in high-quality solutions.
result Improved solution quality and reduced computational time compared to existing methods.
A new test validates ensemble models against the null hypothesis.
problem Validating ensemble models against the null hypothesis of a constant response.
method Randomized permutation test on SVEM model predictions.
result The test maintains Type I error rate even with more parameters than observations.
This paper proposes a new Nystrom-based clustering algorithm for large-scale data.
problem Spectral clustering's high computational complexity for large-scale data.
method Centroid Minimum Sum of Squared Similarities (CMS3) sampling procedure with eigen spectrum shape heuristic.
result Competitive low-rank approximations in test datasets compared to state-of-the-art methods.
Abc-boost is a new line of boosting algorithms for multi-class classification, by utilizing the commonly used sum-to-zero constraint. To implement abc-boost, a base class must be identified at each boosting step. Prior studies used a very expensive procedure based on exhaustive search for determining the base class at …
Proposes ATH for KPI anomaly detection based on local data properties.
problem Business outliers are not always anomalies; existing solutions are limited.
method Adaptive Thresholding Heuristic (ATH) dynamically adjusts detection thresholds.
result ATH minimizes false positives and adapts to concept drift.
In literature there are several studies on the performance of Bayesian network structure learning algorithms. The focus of these studies is almost always the heuristics the learning algorithms are based on, i.e. the maximisation algorithms (in score-based algorithms) or the techniques for learning the dependencies of e…
Simple heuristics can outperform sophisticated methods in high-dimensional pattern recognition.
problem Quantifying the difficulty of high-dimensional pattern recognition problems.
method Classification benchmarks based on simple random projection heuristics.
result Optimal classification curves asymptotes indicate no structural advantage over simple heuristics.
This paper is about two related decision theoretic problems, nonparametric two-sample testing and independence testing. There is a belief that two recently proposed solutions, based on kernels and distances between pairs of points, behave well in high-dimensional settings. We identify different sources of misconception…
Paper tackles flexible bin packing for e-commerce, reducing costs.
problem Optimizing packing of cuboid items into bins with minimal surface area.
method Multi-task Selected Learning approach to generate item packing sequence and orientation.
result Selected Learning method achieves 5.47% cost reduction compared to greedy algorithms.
Three methods detect informed trading on prediction markets, each focusing on different aspects.
problem Detecting informed trading in decentralized prediction markets.
method Composite screen, event-level sign-randomization test, and Information Leakage Score (ILS) framework.
result Different methods detect informed trading on prediction markets, each focusing on different aspects.
This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a threshold-based algorithm for walk summable Gaussian graphical models. Both alg…
A machine learning model improves relative valuation of municipal bonds.
problem Challenges in determining the value or relative value of municipal bonds.
method Proposes a supervised similarity framework using CatBoost algorithm to identify similar bonds based on risk profiles.
result The similarity-based method outperforms rule-based and heuristic-based methods in back-testing.
Kernel tests for set-valued data improve hypothesis testing accuracy.
problem Testing distributions of sets with varying sizes, noise, and nuisance variability.
method Interpreting sets as samples from latent distributions and using kernel methods for testing.
result Kernel tests outperform traditional methods in synthetic and real-world experiments.
In this paper we settle Thurston's old question of whether the Weber-Seifert dodecahedral space is non-Haken, a problem that has been a benchmark for progress in computational 3-manifold topology over recent decades. We resolve this question by combining recent significant advances in normal surface enumeration, new he…
Develops a framework to test excessive influence of small data subsets.
problem Identifying when small data subsets significantly impact model conclusions.
method Formalizes the concept of most influential sets, deriving influence formulas and extreme value distributions.
result Allows rigorous hypothesis testing for excessive influence, resolving contested findings.
E-valuator converts verifier scores into reliable decision rules.
problem Ensuring the correctness of agent trajectories based on heuristic scores.
method Sequential hypothesis testing framework for online monitoring of agent trajectories.
result E-valuator provides better false alarm rate control and statistical power than other strategies.
CPATTA uses conformal prediction for efficient test-time adaptation.
problem Low data selection efficiency in existing ATTA methods.
method Conformal Prediction, online weight-update algorithm, domain-shift detector, staged update scheme.
result CPATTA consistently outperforms state-of-the-art methods by 5% in accuracy.
A novel feature selection method using noise-based hypothesis testing improves feature selection accuracy.
problem Challenges in feature selection for complex, high-dimensional datasets.
method Introduces multiple random noise features and evaluates feature importance against noise feature maxima using non-parametric bootstrap-based hypothesis testing.
result Outperforms existing methods in simulated and real-world datasets.
A new method uses reinforcement learning for hyperparameter optimization.
problem Optimizing hyperparameters in machine learning models.
method Modeling hyperparameter optimization as a sequential decision problem and using reinforcement learning.
result The method outperforms state-of-the-art approaches for hyperparameter learning.
New method uses product embeddings to predict bundle success.
problem Designing effective product bundles in large retail settings.
method Leverage historical purchases and clickstream data to generate product embeddings, then use heuristics for complementarity and substitutability.
result Embeddings-based heuristics predict bundle success, robust across categories and retailers.
TDS provides exact samples for conditional distributions in diffusion models.
problem Lack of exact sampling methods for diffusion models.
method Sequential Monte Carlo (SMC) algorithm with twisting technique.
result TDS offers more accurate approximations with fewer particles compared to heuristics.
DIET tests conditional independence using marginal dependence measures of residual information.
problem Computational intractability of conditional randomization tests (CRTs).
method DIET avoids fitting large models by leveraging marginal independence statistics of information residuals.
result DIET achieves higher power than other tractable CRTs on synthetic and real benchmarks.
Robust subgroup discovery finds non-redundant, statistically significant subgroups.
problem Finding interpretable, robust subgroups from data.
method Formulated subgroup lists for univariate and multivariate targets, used MDL principle and greedy heuristic SSD++.
result SSD++ outperforms previous methods in quality and size of subgroup lists.
Rejoinder on slope heuristics for model selection in regression.
problem Model selection in least-squares fixed-design regression with biased models and general noise.
method Proves the slope heuristics works even with significant bias and computes expectations for Gaussian noise.
result The slope heuristics is valid even when models are biased and noise has a general dependence structure.
Deep RL for dynamic pricing of express lanes considers multiple origins, destinations, and access locations.
problem Dynamic pricing of express lanes with multiple access points and traveler heterogeneity.
method Formulated as a POMDP, uses policy gradient methods and neural networks to determine stochastic tolls.
result Deep RL outperforms traditional methods in maximizing revenue and minimizing travel time.
Study of sentence representations in AI shows parallels to human learning.
problem Understanding how AI systems learn and generalize from training data.
method Diagnostic tests, performance analysis, training distribution effects, representation changes with augmentations.
result AI systems can learn abstract rules and generalize under certain conditions, similar to human zero-shot reasoning.
Study reveals Data Shapley's inconsistent performance in data selection tasks.
problem Inconsistency of Data Shapley's performance in data selection across different settings.
method Hypothesis testing framework and identification of utility functions.
result Data Shapley's performance is no better than random selection without specific constraints.
Framework uses neural networks to learn fitness functions for machine programming.
problem Automatic software generation and crafting effective fitness functions.
method Genetic algorithms augmented with neural networks and a search heuristic.
result Framework discovers more correct programs with fewer candidate generations.
A new sector classification method outperforms existing ones in risk-adjusted returns.
problem Subjective sector classification heuristics like GICS and NAICS are not optimal.
method Learned sector classification using hierarchical clustering and reIndexer evaluation tool.
result 17-sector learned sector universe outperforms GICS and NAICS in backtests.
Automates learning rate tuning in machine learning.
problem Difficulty in tuning the learning rate of stochastic gradient methods.
method Automates the learning rate tuning by using a statistical test to determine when to decrease the learning rate.
result Statistical adaptive stochastic approximation (SASA) method can automatically find good learning rate schedules and match hand-tuned methods.