Combines active learning and logged data for better classifier learning.
problem Learning classifier on entire population from logged data.
method Combines active learning and controlled random experimentation, modifies disagreement-based algorithms.
result Achieves best of active learning and logged data approaches.
Dividing deep learning models for consistent anomaly detection in changing log data.
problem Anomaly detection methods fail when log data types change, leading to false negatives.
method Divide deep learning models based on log data correlation and extract correlations.
result Continues anomaly detection accuracy even when log data changes.
Deep learning models detect and classify log anomalies.
problem Anomaly detection in unstructured log data.
method Auto-LSTM, Auto-BLSTM, and Auto-GRU models for feature extraction.
result Models outperform other algorithms on various log data sets.
The paper proposes a SeqGAN model to generate balanced log messages for anomaly detection.
problem Imbalanced log data makes anomaly detection difficult.
method SeqGAN for generating balanced log messages, Autoencoder for feature extraction, GRU for anomaly detection.
result Oversampling and balancing data improves anomaly detection accuracy.
Logsy detects anomalies in logs using a novel classification-based approach.
problem Anomaly detection in unstructured logs is challenging due to limited model generalization.
method Logsy learns log representations by distinguishing normal and anomaly logs using a classification-based approach with an attention-based encoder and hyperspherical loss function.
result Logsy improves anomaly detection performance by 0.25 in F1 score compared to previous methods.
This paper compares methods for estimating log-likelihood of RBMs.
problem Estimating the log-likelihood of RBMs due to high computational complexity.
method Empirical comparison of AIS, CSL, and RAISE algorithms.
result RAISE algorithm shows the best performance in estimating test log-likelihood.
The study analyzes gaps in well logs to improve prediction models.
problem Improving prediction of missing data in well logs for oil exploration.
method Descriptive analysis, generation of artificial gaps, comparison of machine learning algorithms.
result Artificial Neural Networks, Random Forests, and Linear Regression algorithms were compared in predicting missing data.
Introduces CSLC models to bridge deep generative models and classical algorithms.
problem Mode collapse and memorization issues in deep generative models and restrictive assumptions in classical algorithms.
method Introduces conditionally strongly log-concave (CSLC) models, factorizing data distribution into strongly log-concave conditional distributions.
result Efficient parameter estimation and sampling algorithms with theoretical guarantees for non-log-concave data distributions.
Survey finds log-normal distribution fits better to market trends than stock prices.
problem Analyzing market-technical trend data for better trading systems.
method Statistical evaluation of market-technical trend variables.
result Log-normal assumption better fits market trend data than daily stock returns.
Study designs logging policies to minimize off-policy evaluation error.
problem Minimizing OPE error with logging policies for target policies.
method Characterizes reward-coverage tradeoff, proposes a unifying framework, derives optimal policies.
result Provides actionable guidance for firms choosing recommendation systems.
New method calculates DMN log-likelihood faster.
problem Precise and fast computation of DMN log-likelihood.
method Derived a closed form expression using gamma function properties.
result Closed form calculation is faster with same accuracy.
Anomaly detection system for network logs using ELK, Spark, and Hadoop.
problem Detecting anomalies in network connection logs.
method Streaming architecture, ELK, Spark, Hadoop for data collection and analysis; unsupervised learning with clustering and classification algorithms.
result Identifies subtle variances in log data, highlighting outliers.
A theory of cellwise contamination for compositional data using log-ratios.
problem Contamination in compositional data analysis.
method Develops a theory combining contamination model and propagation theorem.
result Reduction in cellwise breakdown value by (D−1)/D for certain estimators. Extends OPE to evaluate policies using diverse logging data.
problem Evaluate policies using log data from different policies.
method Develops an OPE method for various logging policies.
result Method's predictions converge to true performance as sample size increases.
A simple log-transform fixes heavy-tailed data for generative models.
problem Standard generative models struggle with heavy-tailed data.
method Apply the soft-log transform to data before training and exponentiate samples after generation.
result Log-FM outperforms specialized baselines on multivariate benchmarks.
Test log-likelihood comparisons can be misleading.
problem Misinterpretation of test log-likelihood in model comparison.
method Simple examples of model comparison and forecast accuracy.
result Test log-likelihood does not always correlate with model accuracy.
We explain SSL objectives as log-likelihoods in a data curation model.
problem Lack of understanding of SSL objectives as log-likelihoods.
method Formulate SSL objectives as a log-likelihood in a generative model of data curation.
result SSL methods can be understood as lower-bounds on a principled log-likelihood.
LogAnMeta detects anomalies from log events using meta learning.
problem Poor performance of current log anomaly detection on new or unseen anomalies.
method Meta-learning-based hybrid few-shot classifier trained in an episodic manner.
result Demonstrates efficacy of LogAnMeta on detecting anomalies with few samples.
IBS efficiently estimates log-likelihood without bias.
problem Estimating log-likelihood for complex models.
method Inverse Binomial Sampling (IBS) for efficient, unbiased estimation.
result IBS produces lower error in estimated parameters and maximum log-likelihood values.
Entropy corrections improve GBM's predictive accuracy for non-log-normal distributions.
problem Log-normal distribution limitations in GBM predictions.
method Entropy corrections to geometric Brownian motion (GBM).
result Improved predictive accuracy for non-log-normal distributions.
Proposes a sliding window method for better portfolio trading.
problem Log-optimal portfolio problem with time-varying weights.
method Data-driven sliding window approach to solve log-optimal portfolio problem.
result Trading strategy outperforms classical log-optimal portfolio in cumulative returns.
EnLSTM network improves log generation from small datasets.
problem Generating well logs from small datasets with high accuracy.
method Combining ENN and C-LSTM networks with perturbation methods.
result 34% reduction in mean-square-error compared to existing models.
We speed up inference in log-linear models by using random perturbations and pre-computed data structures.
problem Inference in log-linear models is slow and impractical for large output spaces.
method Gumbel random variable perturbations and Maximum Inner Product Search data structure.
result Sublinear amortized inference and learning in log-linear models with provable guarantees.
Randomized graph construction ensures giant component with fewer edges.
problem Efficiently constructing sparse graphs with good connectivity.
method Randomly connecting points to a subset of their nearest neighbors.
result A sparser graph with comparable connectivity properties.
A novel method for learning DAGs from positive-valued data.
problem Causal discovery from observational data of positive-valued variables.
method Hybrid Moment-Ratio Scoring (H-MRS) algorithm combining moment-based scoring and log-scale regression.
result H-MRS integrates log-scale Ridge regression for moment-ratio estimation with a greedy ordering procedure based on raw-scale moment ratios, followed by Elastic Net-based parent selection.
The paper proposes a new method for clustering survival data using smoothed log-hazard trajectories.
problem Clustering survival data based on instantaneous risk dynamics.
method Functional Principal Component Analysis applied to B-spline smoothed log-hazard trajectories.
result The proposed method provides an interpretable representation of relative temporal risk dynamics.
Paper proposes robust estimators for heavy-tailed data with infinite variance.
problem Developing robust estimators for heavy-tailed data with infinite variance.
method Proposes two robust estimators: ridge log-truncated M-estimator and elastic net log-truncated M-estimator.
result Demonstrates robustness of log-truncated estimations over standard estimations through simulations and real data analysis.
Proposes a new log-rank test using RKHSs for robust two-sample analysis.
problem Two-sample problem in right-censored data.
method Test statistic based on supremum of RKHS-weighted log-rank tests.
result Proposed test is omnibus for a specific family of RKHSs.
Improves log-density gradient estimation for multi-dimensional data.
problem Inaccurate log-density gradient estimation from density estimation.
method Regularized multi-task learning for direct log-density gradient estimation.
result Multi-task method outperforms direct method in multi-dimensional cases.
Model non-stationary financial data using log-normal distributions and Langevin equations.
problem Modeling non-stationary volume-price distributions in finance.
method Model non-stationary volume-price distributions with a log-normal distribution. Derive Langevin equations from the series of log-normal parameters.
result Reconstructed statistics of volume-price distributions fit well empirical data.
Improved algorithm reduces excess risk in selective learning.
problem Selective learning with windowed model selection.
method Hybrid Exponential Weights Algorithm and bounded-recall ERM.
result Achieves expected excess risk of O((log log |L| + log log n) / log n).
The paper evaluates machine learning cyber defenses using log data against adversarial attacks.
problem Evaluating the robustness of machine learning cyber defenses against adversarial attacks.
method Developed a testing framework using deep reinforcement learning and adversarial natural language processing.
result Higher dropout levels increase robustness, with 90% dropout probability showing the highest robustness.
Paper tackles parameter learning for log-supermodular models, improving on existing bounds.
problem Parameter estimation for log-supermodular models with intractable log-partition functions.
method Use stochastic subgradient technique to maximize a lower-bound on the log-likelihood, extending to conditional maximum likelihood.
result Perturb-and-MAP bound outperforms separable optimization bound for parameter estimation.
New method detects anomalies in computing centers' logs.
problem Anomaly detection in continuously changing log data for predictive maintenance.
method Evolving granular classifiers using Fuzzy-set-Based evolving Modeling and evolving Granular Neural Network.
result Classification model prioritizes maintenance based on anomaly severity.
Paper proposes a new estimator for real log canonical thresholds.
problem Estimating real log canonical thresholds for model selection.
method Proposes a new estimator based on thermodynamic integration variance.
result Improves sBIC performance for model selection.
This paper addresses measurement errors in high-dimensional compositional data using a log-contrast model calibration approach.
problem Measurement errors in high-dimensional regression models involving compositional covariates.
method Calibration approach for the linear log-contrast model under lenient sparsity conditions.
result Established asymptotic normality of the estimator for inference.
Develops an anytime-valid framework for optimal policy identification from logged contextual bandit data.
problem Selecting the optimal policy from a candidate policy class while monitoring evidence continuously.
method Constructs a time-indexed set that retains the true optimal policy set uniformly over time.
result The procedure allows the analyst to monitor policy values, eliminate clearly suboptimal policies, and stop at data-dependent times without invalidating inference.
Paper tackles policy selection with logged data and limited online interactions.
problem Safe evaluation and deployment of offline reinforcement learning policies.
method Active offline policy selection combining logged data with online interaction.
result Improves upon state-of-the-art OPE estimates and pure online policy evaluation.
Semi-supervised GANs with log-signatures improve credit card fraud detection.
problem Detecting fraud in large, complex financial transaction data streams.
method Conditional GANs with Bayesian inference and log-signatures for robust feature encoding.
result Consistent improvements over benchmarks in global and domain-specific metrics.
Improved sampling for diffusion models and log-concave distributions.
problem Efficient sampling for diffusion models and log-concave distributions.
method Algorithms for sampling with δ-error in polylog(1/δ) steps using accurate score estimates. result Exponential improvement in complexity over previous results.
Improves SGM convergence bounds in W2-distance without strict assumptions.
problem Convergence bounds for SGMs in W2-distance require stringent assumptions.
method Novel framework using the OU process and PDE analysis.
result Log-concavity evolves from weak to strong over time.
Paper proposes a log-domain training method to reduce neural network complexity.
problem High computational complexity in training deep neural networks limits real-time training.
method End-to-end training and inference scheme using approximate logarithmic operations in the log-domain.
result 16-bit log-based training achieves within 1% accuracy of floating-point baselines.
This paper introduces a method to estimate log-likelihood in VAE models.
problem Difficulty in comparing models trained via ELBO due to lack of log-likelihood.
method Introduces a general upper bound to approximate model evidence.
result Efficiently approximates model evidence and compares to other bounds.
Combines offline causal inference and online bandit learning for better decision-making.
problem Making adaptive decisions using both logged and streaming data to avoid user harm.
method Unified offline causal inference and online learning algorithms, deriving bounds on decision accuracy.
result First upper regret bound for forest-based online bandit algorithms.
A new method combines online and offline learning to tackle contextual bandits with missing action support.
problem Learning optimal policies with logged data when the logging policy has deficient support.
method Hybrid approach using online exploration to exploit supported actions and offline learning to avoid unnecessary explorations.
result Determines an optimal policy with theoretical guarantees using minimal online explorations.
We clarify the status of log-periodicity associated with speculative bubbles preceding financial crashes. In particular, we address Feigenbaum's [2001] criticism and show how it can be rebuked. Feigenbaum's main result is as follows: ``the hypothesis that the log-periodic component is present in the data cannot be reje…
New ANN method for imputing rounded zeros in compositional data.
problem Imputing missing values in compositional data with rounded zeros.
method Artificial Neural Networks (ANNs) for imputation of compositional data.
result ANNs are competitive or better than conventional methods for imputing rounded zeros.
Log-linear models are the popular workhorses of analyzing contingency tables. A log-linear parameterization of an interaction model can be more expressive than a direct parameterization based on probabilities, leading to a powerful way of defining restrictions derived from marginal, conditional and context-specific ind…