Smoothed fitness landscape improves protein optimization.
problem Infeasibility of combinatorially large protein sequence space.
method Formulate protein fitness as a graph signal, smooth using Tikunov regularization, and optimize with Gibbs sampling.
result 2.5 fold fitness improvement over training set.
The paper improves dropout's utility by reducing interactions in deep neural networks.
problem Over-fitting problem in deep learning.
method Game-theoretic interactions analysis and interaction loss.
result Interaction loss improves dropout's utility and boosts DNN performance.
We propose a data aggregation-based algorithm with monotonic convergence to a global optimum for a generalized version of the L1-norm error fitting model with an assumption of the fitting function. The proposed algorithm generalizes the recent algorithm in the literature, aggregate and iterative disaggregate (AID), whi…
New NMF algorithms improve topic model fits.
problem Improving topic model fits for large datasets.
method Leveraging recent NMF optimization methods to fit topic models efficiently.
result Better topic model fits and faster computation times.
Improved modeling of persistence diagrams for data analysis.
problem Determining significant outliers in persistence diagrams.
method Modification of the RST (Replicating Statistical Topology) model using MCMC Metropolis-Hastings algorithm.
result The modified RST model improves the goodness of fit in persistence diagram analysis.
Improved KSD test for better detection of differences in distributions.
problem Low power of KSD test when distributions have same modes but different mixing proportions.
method Perturb the observed sample using Markov transition kernels to improve KSD test power.
result Perturbed KSD test can lead to substantially higher power than the original KSD test.
This paper improves volatility forecasting using dynamic subset selection in genetic programming.
problem Improving accuracy of implied volatility forecasting.
method Dynamic training-subset selection methods applied to genetic programming.
result Dynamic subset selection improves predictive accuracy of genetic programming models.
Paper uses DRL to improve volatility fitting in equity derivatives.
problem Improving volatility fitting in equity derivatives markets.
method Apply Deep Reinforcement Learning (DRL) to solve the fitting problem.
result DRL algorithms achieve at least as good as standard fitting methods.
A new method improves fitting neural data with spiking network models.
problem Fitting spiking network models to neural activity does not produce realistic data.
method Augment log-likelihood with dissimilarity terms measured by summary statistics and optimized via back-propagation.
result The new method generates more realistic neural activity statistics and improves network connectivity inference.
Missing values, irregularly collected samples, and multi-resolution signals commonly occur in multivariate time series data, making predictive tasks difficult. These challenges are especially prevalent in the healthcare domain, where patients' vital signs and electronic records are collected at different frequencies an…
Improved SSD for faster and more accurate goodness-of-fit tests and model learning.
problem Optimal slicing directions for SSD are computationally expensive and sub-optimal.
method Relaxed optimal slicing requirement, active sub-space construction, spectral decomposition.
result 14-80x speed-up in goodness-of-fit tests compared to gradient-based alternatives.
We present and evaluate the Fast (conditional) Independence Test (FIT) -- a nonparametric conditional independence test. The test is based on the idea that when P ( X ∣ Y , Z ) = P ( X ∣ Y ) P(X \mid Y, Z) = P(X \mid Y) P ( X ∣ Y , Z ) = P ( X ∣ Y ) , Z Z Z is not useful as a feature to predict X X X , as long as Y Y Y is also a regressor. On the contrary, if $P(X \mid Y, Z) \neq P(X…
Study presents MMC model for better fitting multiple choice data.
problem Improving accuracy of latent trait estimates in IRT models.
method Fit autoencoders to MMC model, demonstrating better fit than nominal response model.
result MMC model outperforms traditional IRT models in fit.
Improved nuclear cross section fitting with weighted Levenberg-Marquardt method.
problem Challenging optimization in multichannel nuclear cross section data.
method Weighted Levenberg-Marquardt algorithm with Fisher Information Metric.
result More physically consistent fits for raw and smoothed datasets.
Hawkes processes have seen a number of applications in finance, due to their ability to capture event clustering behaviour typically observed in financial systems. Given a calibrated Hawkes process, of concern is the statistical fit to empirical data, particularly for the accurate quantification of self- and mutual-exc…
STNN models forecast COVID-19 spread with improved accuracy.
problem Forecasting the spread of COVID-19 worldwide.
method Spatio-temporal Neural Network (STNN) incorporating spatial and temporal data.
result STNN models outperform classical models in accuracy and handling both spatial and temporal data.
New method improves causal structure discovery with Prior-Fitted Networks.
problem Errors in likelihood estimation limit proper causal structure discovery.
method Amortized causal discovery with Prior-Fitted Networks.
result Significant gains in structure recovery compared to baselines.
New method improves feasibility of fitting Gaussian vectors to an ellipsoid.
problem Feasibility of fitting n n n Gaussian vectors to an ellipsoid boundary. method Improved concentration of Gram matrices using Bartl & Mendelson (2022) results.
result Feasibility of ( P ) (\mathrm{P}) ( P ) with high probability when n ≤ d 2 / C n \leq d^2 / C n ≤ d 2 / C . In regression modelling approach, the main step is to fit the regression line as close as possible to the target variable. In this process most algorithms try to fit all of the data in a single line and hence fitting all parts of target variable in one go. It was observed that the error between predicted and target var…
The problem of automatic software generation is known as Machine Programming. In this work, we propose a framework based on genetic algorithms to solve this problem. Although genetic algorithms have been used successfully for many problems, one criticism is that hand-crafting its fitness function, the test that aims to…
A common problem machine learning developers are faced with is overfitting, that is, fitting a pipeline too closely to the training data that the performance degrades for unseen data. Automated machine learning aims to free (or at least ease) the developer from the burden of pipeline creation, but this overfitting prob…
We investigate whether the bid/ask queue imbalance in a limit order book (LOB) provides significant predictive power for the direction of the next mid-price movement. We consider this question both in the context of a simple binary classifier, which seeks to predict the direction of the next mid-price movement, and a p…
Neyman-Pearson testing improves goodness of fit in detecting new physics.
problem Detecting small anomalies in data distributions.
method Employing Neyman-Pearson strategy with a rich parametrized family of models.
result Neyman-Pearson testing is more sensitive to small departures and unbiased towards specific anomalies.
Sliced kernelized Stein discrepancy improves goodness-of-fit tests and model learning in high dimensions.
problem The curse-of-dimensionality in kernelized Stein discrepancy (KSD).
method Sliced Stein discrepancy and its scalable variants using optimal one-dimensional projections.
result Significantly outperforms KSD and baselines in goodness-of-fit tests and improves model learning.
New spectral tests assess network model fits efficiently.
problem Determining if network models fit data well and extrapolate.
method Random matrix theory-derived goodness-of-fit tests.
result General approach simplifies parameter selection in network models.
Personalized size and fit recommendations bear crucial significance for any fashion e-commerce platform. Predicting the correct fit drives customer satisfaction and benefits the business by reducing costs incurred due to size-related returns. Traditional collaborative filtering algorithms seek to model customer prefere…
Meta-learners improve causal effect estimation in small samples.
problem Estimating causal effects using machine learning methods.
method Sample-splitting and cross-fitting to reduce overfitting bias.
result Meta-learners' performance depends on sample size and estimation procedure.
Improves model accuracy for neural nets in stochastic dynamics with partial prior knowledge.
problem Stability and accuracy in neural nets modeling stochastic dynamics with many parameters.
method Three steps: probabilistic weights, partial knowledge incorporation, and PAC-Bayesian training.
result Improved model fit with partial and noisy prior knowledge.
New deep learning methods improve estimation and GOF assessment for large-scale IFA.
problem Estimating and assessing goodness-of-fit for large-scale confirmatory IFA models.
method Extended deep learning algorithm for parameter estimation and simulation-based tests for GOF assessment.
result Proposed methods provide comparable estimates and detect latent dimensionality misspecification.
The paper solves the problem of fitting an ellipsoid to random points efficiently.
problem Finding an ellipsoid that passes through random Gaussian points.
method Constructing a fitting ellipsoid using a decomposition of a random matrix and graph matrix theory.
result The ellipsoid fitting problem transitions from feasible to infeasible at a sharp threshold of n ∼ d 2 / 4 n \sim d^2/4 n ∼ d 2 /4 . Improved symbolic regression finds optimal formulas robust to noise.
problem Finding accurate formulas for noisy data.
method Exploits graph modularity, uses normalizing flows, and statistical hypothesis testing.
result Discoveres many formulas previously unattainable.
Fourier representation improves KSD for infinite-dimensional data.
problem Applying KSD to infinite-dimensional data.
method Combining measure equations with kernel methods for a Fourier representation of KSD.
result KSD can separate measures in infinite-dimensional Hilbert spaces.
CEDA improves understanding of data fit to models.
problem Real-world data often deviates from theoretical models.
method Categorical Exploratory Data Analysis (CEDA) to highlight deviations.
result CEDA reveals where and how data fits or deviates from models.
GCMM improves clustering and fits un-synchronized data.
problem Improving clustering performance with copulas.
method Mathematical definition, copula concepts, Expectation Maximum algorithms, nonparametric estimation.
result GCMM outperforms GMM in goodness-of-fit and data analysis.
Enhances graph classification models on small datasets.
problem Over-fitting and undergeneralization on small-scale benchmark datasets.
method Data augmentation via graph structure transformation and model evolution framework.
result Average improvement of 3 - 13% accuracy on graph classification tasks.
Standard sparse pseudo-input approximations to the Gaussian process (GP) cannot handle complex functions well. Sparse spectrum alternatives attempt to answer this but are known to over-fit. We suggest the use of variational inference for the sparse spectrum approximation to avoid both issues. We model the covariance fu…
Develops a new method to model overlapping asymmetric datasets effectively.
problem Handling overlapping asymmetric datasets in data science.
method Twice penalized P-Spline approximation method.
result Improves model fit by over 65% in a real-life dataset.
New ABC method improves Bézier simplex fitting for noisy data.
problem Overfitting in Bézier simplex fitting when sample points are not on the Pareto set.
method Extended Bézier simplex model to a probabilistic one and proposed a new learning algorithm based on approximate Bayesian computation (ABC) with Wasserstein distance.
result The new algorithm converges on a finite sample and outperforms deterministic methods on noisy instances.
Improved estimators for causal inference using cross-fitting and undersmoothing.
problem Estimating expected conditional covariance in causal inference.
method Double cross-fit doubly robust (DCDR) estimators with undersmoothing for non-smooth nuisance functions.
result DCDR estimators achieve n \sqrt{n} n -consistency and asymptotic normality under minimal conditions. New estimators improve causal inference in machine learning studies.
problem Improving causal inference in machine learning models.
method Doubly-robust cross-fit estimators for average causal effect.
result Doubly-robust cross-fit estimators outperform other methods in simulations.
Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing
problem Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing
method Reformulating Stein discrepancy construction as an explicit SNR^2 maximisation problem
result Avoiding exponential SNR^2 collapse and achieving stable SNR^2
Combines datasets to improve model fitting with small sample sizes.
problem Improving model performance with limited samples from at least one dataset.
method Proposes a novel framework called Combine datasets based on Imputation (ComImp) and PCA-ComImp for combining datasets with missing data.
result Significant improvement in model accuracy, especially with small datasets and when combined with transfer learning.
Improves decision-making in models fit with AEVB by using distinct approximate posteriors.
problem Bias in expected risk estimates due to variational distribution use.
method Use multiple approximate posteriors, including those distinct from variational, for decision-making.
result Proposed approach outperforms state-of-the-art methods in single-cell RNA sequencing.
Two algorithms improve fitting autoregressive models for big data.
problem Efficiently solving Toeplitz least squares problems for large time series data.
method Applied randomized numerical linear algebra (RandNLA) techniques.
result LSAR algorithm is more robust for real-world time series data.
A new method for handling missing values in data.
problem Handling missing values in machine learning models.
method Sharing pattern submodels with sparsity-inducing regularization.
result Sharing pattern submodels provide robust predictions and maintain/improve pattern submodel performance.
A new test method improves goodness-of-fit tests for copulas.
problem Developing robust tests for copula goodness-of-fit.
method Binary Expansion Approximation of UniformiTY (BEAUTY) and Binary Expansion Adaptive Symmetry Test (BEAST).
result The BEAST method improves empirical power against various alternatives.
R2T hybrid model improves robust regression for asymmetric noise.
problem Least-squares regression fails with asymmetric structured noise.
method Transformer encoder, compression NN, fixed symbolic equation.
result Median regression MSE of 6e-6 to 3.5e-5 on synthetic data.
RAMs improve GAMs' accuracy by fitting components to subregions of feature space.
problem Subpar accuracy in GAMs due to inability to capture feature interactions.
method Identify subregions of feature space where interactions are minimized, fitting one component per subregion.
result RAMs offer improved expressiveness compared to GAMs while maintaining interpretability.