Machine learning models predict bluebottles' presence on beaches, addressing class imbalance and unreliable absence data.
problem Predicting bluebottles' presence on beaches with machine learning, tackling class imbalance and unreliable absence data.
method Used Multilayer Perceptron, Random Forest, and XGBoost models; employed data augmentation techniques like SMOTE, Random Undersampling, and Synthetic Negative Approach.
result Random Forests combined with Synthetic Negative Approach provided the best predictive model, identifying wind direction as a key factor.
Paper quarantines unreliable Yelp users by detecting review spam.
problem Unreliable and spamming users deceive Yelp's users.
method Used RSD and spam detection techniques on key features.
result More than 80% of Yelp's accounts are unreliable, and highly-rated businesses are often spammed.
Unsupervised learning models can be indistinguishable without identifiability, leading to unreliable representations.
problem Unsupervised learning models may be indistinguishable without identifiability, making it impossible to recover a ground truth generative model.
method Construction based on nonlinear independent component analysis theory to illustrate potential failure cases.
result Counterexamples show that identifiability is crucial for reliable unsupervised representation learning.
Many machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process…
Classifier learns to ignore unreliable feedback from end users.
problem Improving classifier performance by filtering unreliable feedback.
method Modeling end users as autonomous agents, periodically retraining classifier with filtered feedback.
result Classifier can identify and filter out unreliable feedback, improving performance.
New method corrects selection bias in post-selective inference for Group LASSO.
problem Inference after Group LASSO selection is unreliable.
method Develops a consistent, post-selective Bayesian method to adjust for selection bias.
result Corrects bias in recovering effects of selected variables.
FLEA makes fair classifiers robust against unreliable training data.
problem Fairness in machine learning from unreliable data sources.
method Filtering-based algorithm to identify and suppress unfair data sources.
result FLEA protects classifiers against corruptions as long as less than half of data sources are unreliable.
Study detects P-type bifurcations in single system realizations using unreliable kernel density estimates.
problem Detecting P-type bifurcations in signals with unreliable kernel density estimates.
method Create persistence diagrams from single system realization, statistically analyze resulting set, compare point process modeling methods.
result Subsampling outperforms other point process modeling methods in predicting P-type bifurcations.
rMFBO improves MFBO by making it robust to unreliable low-fidelity sources.
problem Optimizing expensive functions with unreliable low-fidelity approximations.
method rMFBO (robust MFBO) integrates a theoretical guarantee to make GP-based MFBO robust to unreliable sources.
result rMFBO outperforms earlier MFBO methods on unreliable sources.
RiskNet predicts penalties in unreliable communication networks using GNNs.
problem Predicting penalties in networks with unreliable resources.
method Graph Neural Network (GNN) based approach trained on random graphs.
result Precisely models penalties across various network topologies.
Simulation-based inference methods can produce unreliable posterior approximations.
problem Reliability of simulation-based inference methods for scientific use cases.
method Benchmarked algorithms including Neural Posterior Estimation, Neural Ratio Estimation, Sequential Neural Likelihood, and Approximate Bayesian Computation.
result Ensembling posterior surrogates provides more reliable approximations.
Clustering using deep autoencoders has been thoroughly investigated in recent years. Current approaches rely on simultaneously learning embedded features and clustering the data points in the latent space. Although numerous deep clustering approaches outperform the shallow models in achieving favorable results on sever…
We use a novel modification of Multi-Armed Bandits to create a new model for recommendation systems. We model the recommendation system as a bandit seeking to maximize reward by pulling on arms with unknown rewards. The catch however is that this bandit can only access these arms through an unreliable intermediate that…
In principle, zero-shot learning makes it possible to train a recognition model simply by specifying the category's attributes. For example, with classifiers for generic attributes like \emph{striped} and \emph{four-legged}, one can construct a classifier for the zebra category by enumerating which properties it posses…
Paper tackles robust transfer learning with unreliable source data.
problem Challenges in robust transfer learning stemming from ambiguity in Bayes classifiers and weak transferable signals.
method Introduces ambiguity level, proposes Transfer Around Boundary (TAB) model, establishes general theorem.
result Demonstrates efficiency and robustness of TAB model improving classification while avoiding negative transfer.
It is shown that absence of arbitrage opportunity in financial markets is a particular case of existence of uncertainty in decision system. Absence of arbitrage opportunity is considered in the sense of the Arrow-Debreu model of financial market with a riskless asset, while uncertainty (or ambiguity) is defined on the …
OpinionRank uses graph-based ranking to improve unreliable crowdsourced labels.
problem Improving trustworthiness of crowdsourced labels for machine learning.
method Graph-based spectral ranking to integrate unreliable labels.
result OpinionRank outperforms conventional algorithms in reliability and scalability.
TRIP detects unreliable feature importance scores in random forests.
problem Unreliable feature importance scores in random forests due to model extrapolation.
method Develops TRIP (Test for Reliable Interpretation via Permutation) to detect unreliable permutation feature importance scores.
result TRIP reliably detects unreliable permutation feature importance scores in high-dimensional settings.
We propose Deep Asymmetric Multitask Feature Learning (Deep-AMTFL) which can learn deep representations shared across multiple tasks while effectively preventing negative transfer that may happen in the feature sharing process. Specifically, we introduce an asymmetric autoencoder term that allows reliable predictors fo…
Statsformer validates and adapts LLM-derived semantic priors for improved supervised learning.
problem Unreliable semantic priors from LLMs can degrade supervised learning performance.
method Adapts LLM-derived feature scores into a family of learner-specific prior-injection mechanisms, calibrating their influence using out-of-fold validation.
result Improves prediction performance by adaptively downweighting unreliable LLM priors, ensuring a guardrailed statistical learning system.
In a semimartingale financial market model, it is shown that there is equivalence between absence of arbitrage of the first kind (a weak viability condition) and the existence of a strictly positive process that acts as a local martingale deflator on nonnegative wealth processes.
Classification algorithms have been widely adopted to detect anomalies for various systems, e.g., IoT, cloud and face recognition, under the common assumption that the data source is clean, i.e., features and labels are correctly set. However, data collected from the wild can be unreliable due to careless annotations o…
Method estimates noise transition matrix from noisy labels without relying on unreliable class-posterior estimation.
problem Estimating noise transition matrix from noisy data.
method Total variation regularization to encourage distinguishable predicted probabilities.
result Consistent estimator of the noise transition matrix under mild assumptions.
Data describing historical economic growth are analysed. They demonstrate convincingly that the takeoffs from stagnation to growth, claimed in the Unified Growth Theory, never happened. This theory is again contradicted by data, which were used, but never properly analysed, during its formulation. The absence of the cl…
We provide two examples of spectral analysis techniques of Schroedinger operators applied to geometric Laplacians. In particular we show how to adapt the method of analytic dilation to Laplacians on complete manifolds with corners of codimension 2 finding the absence of singular continuous spectrum for these operators,…
In this paper we study arbitrage theory of financial markets in the absence of a numéraire both in discrete and continuous time. In our main results, we provide a generalization of the classical equivalence between no unbounded profits with bounded risk (NUPBR) and the existence of a supermartingale deflator. To obtain…
New conditions prevent gaps in optimal control problems.
problem Preventing gaps in optimal control problems with state constraints.
method Developed new sufficient conditions not relying on convexity.
result Derived bounds for the size of the relaxation gap.
When a Riemannian manifold (M,g) is rotationally symmetric, the critical order of the lower bound of radial curvatures for the absence of eigenvalues of the Laplacian is equal to −r1, where r stands for the distance to the center point. In this paper, we shall perturb the Riemannian metric around a rota…
We characterize absence of arbitrage with simple trading strategies in a discounted market with a constant bond and several risky assets. We show that if there is a simple arbitrage, then there is a 0-admissible one or an obvious one, that is, a simple arbitrage which promises a minimal riskless gain of ε, if the inves…
LLMs show biases in investment analysis, leading to unreliable recommendations.
problem LLMs face conflicts between pre-trained knowledge and real-time market data, leading to biases in investment analysis.
method Experimental framework to investigate emergent behaviors in LLMs, analyzing sector, size, and momentum biases.
result Distinct, model-specific biases observed, including a tendency to prefer technology stocks, large-cap stocks, and contrarian strategies.
New method for decentralized learning reduces data and computation needs.
problem High complexity and data/compute requirements for neural network training.
method Asynchronous updates over unreliable network using Distributed Averaging Consensus.
result Models can be learned on highly biased datasets with intermittent communication.
Glitches cause unreliable AI decisions with steep boundaries.
problem Glitches impair the reliability of AI models with steep decision boundaries.
method Formal definition of glitches, algorithmic search using MILP encoding.
result Glitches are widespread and indicate potential model inconsistencies.
In many applications, different populations are compared using data that are sampled in a biased manner. Under sampling biases, standard methods that estimate the difference between the population means yield unreliable inferences. Here we develop an inference method that is resilient to sampling biases and is able to …
Corners can be identified by a drum's sound spectrum.
problem Determining the presence of corners in a drum's shape from its sound.
method Proving spectral invariance of corners in domains with Lipschitz, piecewise smooth boundaries.
result Corners are uniquely determined by a drum's spectrum among domains with fixed genus.
QS-BO optimizes functions using only rank-based feedback.
problem Optimizing expensive functions with unreliable or unavailable metric values.
method Quantile-scaling pipeline to convert ranks into Gaussian targets.
result QS-BO consistently achieves lower objective values and is statistically significant.
Paper addresses Byzantine attacks in decentralized optimization over networks.
problem Byzantine attacks in decentralized stochastic optimization over static and time-varying networks.
method Formulate a TV norm-penalized approximation of the problem, solve using stochastic subgradient method.
result Proposed method reaches a neighborhood of the Byzantine-free optimal solution.
Counterfactual post-hoc interpretability approaches have been proven to be useful tools to generate explanations for the predictions of a trained blackbox classifier. However, the assumptions they make about the data and the classifier make them unreliable in many contexts. In this paper, we discuss three desirable pro…
We find a resonance free region polynomially close to the critical line on Conformally compact manifolds with polyhomogeneous metric.
Preconditioned neural posterior estimation improves reliability in misspecified models.
problem Reliability issues in neural posterior estimation for misspecified models.
method Preconditioning with data-dependent weights and forest-proximity scores to stabilize and improve accuracy.
result Preconditioned robust neural posterior estimation increases stability and accuracy over standard methods.
No closed timelike geodesics in Kerr spacetimes, proving absence of closed causal geodesics.
problem Proving the nonexistence of closed timelike geodesics in Kerr spacetimes.
method Analyzing the Kerr-star spacetime, excluding closed null geodesics and proving the nonexistence of closed timelike geodesics.
result No closed timelike geodesics in Kerr spacetimes.
RRPI improves offline RL by optimizing policies against worst-case dynamics.
problem Offline RL's performance degrades under distribution shift and transition uncertainty.
method Formulates offline RL as robust policy optimization, treating transition kernel as decision variable.
result RRPI achieves strong average performance on D4RL benchmarks, outperforming recent baselines.
The concept of absence of opportunities for free lunches is one of the pillars in the economic theory of financial markets. This natural assumption has proved very fruitful and has lead to great mathematical, as well as economical, insights in Quantitative Finance. Formulating rigorously the exact definition of absence…
Study shows fairness metrics are unreliable for small datasets in NLP tasks.
problem Unreliable fairness metrics for small datasets in NLP tasks.
method Experiments on Bios dataset with varying model sizes.
result Common fairness indices provide unreliable results for small samples.
A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full conditional independence between these two variables given all the other variables. In…
In this paper, we consider the eigen-solutions of −Δu+Vu=λu, where Δ is the Laplacian on a non-compact complete Riemannian manifold. We develop Kato's methods on manifold and establish the growth of the eigen-solutions as r goes to infinity based on the asymptotical behaviors of Δr and V(x), where r=r(x) i…
New analysis shows reconstruction attacks are unreliable without prior data knowledge.
problem Privacy and security risks from neural network memorization of training data.
method Complementary analysis of reconstruction methods, proving their unreliability without prior data knowledge.
result Reconstruction attacks are fundamentally unreliable without prior data knowledge, and networks trained more extensively are less susceptible.
Transformers for binary decisions are sensitive to evidence order, leading to unreliable outcomes.
problem Order sensitivity in Transformers for binary decisions leads to unreliable outcomes.
method Formalized an expectation-realization gap and developed QMV and EDFL bounds.
result Uniform permutation mixtures reduce dispersion and improve reliability.
LSTM models predict low likelihood of another COVID-19 wave in India.
problem Inaccurate and unreliable COVID-19 infection forecasting models due to data limitations and model complexity.
method Application of LSTM, bidirectional LSTM, and encoder-decoder LSTM models for multi-step infection forecasting.
result Predictions indicate low likelihood of another wave in October and November 2021.