GANs visualize malware behavior for proactive protection.
problem Malware authors' advantage in testing and augmenting malicious code.
method GAN trained on distributed image representation of malware behaviors.
result Generated synthetic malware for adversarial training of anti-malware models.
RePAD detects anomalies in streaming time series data in real-time.
problem Real-time anomaly detection for time series data without human intervention.
method RePAD uses LSTM to predict anomalies based on short-term historic data.
result RePAD detects anomalies proactively and provides early warnings.
Proceed adapts models proactively against concept drift in online time series forecasting.
problem Concept drift causes forecast models to adapt to outdated concepts, reducing performance.
method Proceed estimates and translates concept drift into parameter adjustments, enhancing model resilience.
result Proceed brings more performance improvements than state-of-the-art online learning methods.
This research improves capital efficiency and impermanent loss in cryptocurrency markets using multi-token trading pools.
problem Poor impermanent loss and capital efficiency in automated market makers.
method Analysis and construction of a multi-token token proactive market maker (MPMM).
result MPMM shows better impermanent loss and capital efficiency than comparable market makers.
Proposes proactive bed requests to reduce ED boarding and patient wait times.
problem Reduces ED boarding and patient wait times by proactively requesting inpatient beds.
method Formulates as a Markov decision process, uses predictions of admission probability and time to disposition to guide bed requests.
result Proactive aggregate bed requests can reduce boarding times by 30-70% and length of stay by 6-15%.
Approach detects illegal insider trading proactively from diverse data sources.
problem Detecting illegal insider trading in the stock market.
method Deep-learning and discrete signal processing on time series data, combined with tree-based visualization.
result Approach has a good success rate in detecting illegal insider trading patterns.
This paper evaluates targeted data poisoning attacks by focusing on the hardest samples, improving evaluation and defense strategies.
problem The effectiveness of targeted data poisoning attacks is often overestimated due to average evaluation methods.
method The paper introduces metrics to identify the hardest and easiest to poison samples based on clean model information.
result The proposed metrics reliably stratify samples by poisoning vulnerability, enabling rigorous worst-case evaluation and proactive defense.
CANARI detects near-anomalies to predict future anomalies proactively.
problem Uncertainty in anomaly detection near distribution boundaries.
method Christoffel-based ANomaly Anticipation for eaRly dIscovery (CANARI) method.
result CANARI outperforms baseline methods in detecting near-anomalies and predicting future anomalies.
Paper proposes SDS for 5G security using machine learning.
problem Cybersecurity threats and expanding IoT in 5G networks.
method SDS uses machine learning, specifically a CNN with NAS, to detect anomalies.
result CNN achieved 100% accuracy in identifying benign traffic and 96.4% in detecting anomalies.
ProEval efficiently estimates AI performance and discovers failures using pre-trained Gaussian Processes.
problem Resource-intensive evaluation of generative AI models.
method ProEval uses pre-trained Gaussian Processes and Bayesian quadrature to estimate performance and discover failures.
result ProEval requires significantly fewer samples to achieve accurate performance estimates and reveals more diverse failure cases.
The paper proposes a proactive method to improve model reliability by removing unstable relationships in the training data.
problem Improper generalization of predictive models due to dataset shift.
method Proactively removing unstable relationships using causal mechanisms and latent counterfactual variables.
result Models that remove vulnerable variables and use estimates of latent variables transfer better, often outperforming in the target domain.
Algorithms learned from data are increasingly used for deciding many aspects in our life: from movies we see, to prices we pay, or medicine we get. Yet there is growing evidence that decision making by inappropriately trained algorithms may unintentionally discriminate people. For example, in automated matching of cand…
HyPV-LEAD detects cryptocurrency anomalies proactively, improving financial security.
problem Cryptocurrency anomalies like mixing, fraud, and pump-and-dump operations are hard to detect due to class imbalance and temporal volatility.
method HyPV-LEAD integrates lead time into anomaly detection through window-horizon modeling, Peak-Valley sampling, and hyperbolic embedding.
result HyPV-LEAD achieves a PR-AUC of 0.9624 on Bitcoin transaction data, significantly outperforming state-of-the-art methods.
The paper develops efficient sampling strategies for BRDF data manifolds.
problem Efficiently sampling and measuring BRDF data from high-dimensional manifolds.
method Statistical design of experiments and generalized proactive learning.
result Established more efficient sampling and measurement strategies for BRDF data manifolds.
Paper analyzes liquidity for everlasting options in DeFi, offering strategies to reduce costs.
problem Challenges of perpetual derivatives in decentralized finance markets.
method Dynamic proactive market maker model, simulations, hedging strategies.
result Liquidity providers can achieve net positive PnL with effective strategies.
In recent times, the manufacturing processes are faced with many external or internal (the increase of customized product rescheduling , process reliability,..) changes. Therefore, monitoring and quality management activities for these manufacturing processes are difficult. Thus, the managers need more proactive approa…
Paper proposes protecting DNN models with secret key preprocessing.
problem Protecting deep learning models from unauthorized access.
method Block-wise pixel shuffling with secret key for preprocessing.
result Protected models maintain close performance to non-protected models with correct key, but accuracy drops significantly with incorrect key.
Paper proposes a new approach to GDPR compliance using data protection analytics.
problem Lack of research on data protection risk management and difficulty in GDPR compliance.
method Quantitative approach to data protection risk-based compliance.
result Improves data protection impact assessments by integrating analytics and expert opinions.
Prophet predicts device qualities for FL to reduce training latency.
problem Bad candidate-selection leads to large training and reporting latency in FL.
method Each device predicts its own training and reporting phases using LSTM. The algorithm is implemented with DRL.
result The proposed approach outperforms reactive algorithms in real-world experiments.
Climate-contingent finance helps adapt to uncertain climate risks.
problem Uncertainty in future climate scenarios makes proactive adaptation less feasible.
method Underwrite climate adaptation projects with repayment based on future climate scenarios.
result Optimal financing reduces over- and under-preparation risks.
Models predict patients at risk of uncontrolled hypertension.
problem Identifying patients at risk of uncontrolled hypertension.
method Developed machine learning models (logistic regression and recurrent neural networks) using EHR data.
result Best model achieved AUROC of 0.719, outperforming baseline.
Robust policies improve ICU transfer outcomes by predicting patient deterioration.
problem Higher mortality rates for unplanned ICU transfers.
method Markov Decision Process model to predict patient severity and optimize transfer policies.
result Robust policies are more aggressive in transferring patients than nominal policies, improving overall patient care.
Proposes Deep Fair Clustering for fair clustering with multiple protected groups.
problem Ensuring fair clustering with multiple protected groups.
method Deep Fair Clustering learns a fair cluster assignment function.
result Improves fairness while only slightly sacrificing clustering quality.
Develops methods to measure and reduce fairness in datasets with limited protected attribute labels.
problem Measuring and reducing fairness in datasets with limited protected attribute labels.
method Proposes methods to estimate fairness metrics and train models to limit fairness violations using probabilistic protected attribute labels.
result Our methods provide tighter bounds on true disparity and effectively reduce fairness violations with lesser fairness-accuracy trade-offs.
Study protects federated learning models from eavesdropping attacks.
problem Protecting client models in federated learning from eavesdropping adversaries.
method Theoretical analysis and numerical experiments examining various factors.
result Theoretical and experimental results show the effectiveness of protection methods.
Fairness audits fail under missing protected labels, especially at zero access.
problem Understanding the reliability of fairness audits with incomplete protected-label data.
method Introduced a seed-calibrated stress test to separate missingness effects from seed-to-seed movement.
result Missing protected labels do not significantly alter fairness mitigation methods, but they can lead to harmful intersectional outcomes.
New algorithm shows how networked agents can protect against systemic risk.
problem Understanding and managing systemic risk in networked systems.
method Developed a simple algorithm to model protection dynamics in networked agents.
result Protection mechanisms can emerge even in random networks, reducing systemic risk.
New methods ensure fairness in noisy protected groups.
problem Noisy or biased protected group information complicates fairness audits.
method Robust optimization techniques to enforce fairness on true groups.
result Robust approaches achieve better true group fairness guarantees.
RODMAN improves ML-based disk failure prediction accuracy in cloud environments.
problem Imperfect data quality in real-world cloud environments degrades ML-based disk failure prediction accuracy.
method RODMAN uses three data preprocessing techniques: failure-type filtering, spline-based data filling, and automated pre-failure backtracking.
result RODMAN significantly improves prediction accuracy compared to no preprocessing.
The paper analyzes how to combine self-protection and self-insurance for risk reduction.
problem Combining self-protection and self-insurance for risk reduction when market insurance is absent.
method The approach uses Value-at-Risk and Tail Value-at-Risk to evaluate residual risk and solves the problem using isoquant geometry based on marginal-balance curves.
result The analysis identifies the conditions under which self-protection and self-insurance behave as substitutes or complements.
Researchers create topologically protected knots in a realizable system.
problem Creating topologically protected vortex knots in experimentally realizable systems.
method Investigated non-Abelian vortices in tetrahedral order in spin-2 Bose--Einstein condensates and bent-core nematic liquid crystals.
result Discovered the first topologically protected knots in an experimentally realizable system.
The paper proposes methods to infer from privacy-protected data using simulation-based techniques.
problem Valid statistical inference from privacy-protected data is computationally challenging.
method Simulation-based inference methods, including sequential Monte Carlo and neural conditional density estimators.
result Valid statistical inferences can be made from privacy-protected data.
Framework for fair classification with noisy protected attributes and provable guarantees.
problem Fair classification with noisy protected attributes.
method Optimization framework for linear and linear-fractional fairness constraints, handling multiple non-binary attributes.
result Provably fair classifier with minimal accuracy loss, even with large noise.
Proactive DP optimizes privacy and utility in DP-SGD with a fixed privacy budget.
problem Balancing privacy and utility in differential privacy for machine learning.
method Proposes a pro-active DP framework that allows a-priori selection of DP-SGD parameters to maximize test accuracy.
result Proactive DP can optimize utility of DP-SGD with a fixed privacy budget (ε, δ).
A multi-task network avoids indirect discrimination in insurance pricing.
problem Indirect discrimination in insurance pricing models based on protected characteristics.
method Multi-task neural network architecture trained with partial protected characteristic information.
result Multi-task network produces discrimination-free insurance prices with comparable accuracy to conventional models.
Study removes bias from chest X-ray embeddings using orthogonalization.
problem Reduces bias in chest X-ray embeddings due to protected features.
method Orthogonalization technique to remove protected feature effects.
result Orthogonalization removes bias and makes predictions of protected attributes infeasible.
Method reduces bias in occupation classification without protected attribute data.
problem Mitigating bias in occupation classification without access to protected attributes.
method Uses word embeddings to discourage correlation between predicted occupation probability and name.
result Reduces race and gender biases without significant loss in true positive rate.
Improves fairness without protected group labels by using proxy groups.
problem Lack of protected group labels makes it hard to improve fairness.
method Investigates improving fairness metrics for proxy groups and tests their effectiveness.
result Proxy fairness strategy works well in practice but depends on fairness metric choice.
Protects user privacy in models using optional personal data.
problem Ensuring fairness for users who opt-out of data sharing.
method Formalizes protection requirements, introduces Protected User Consent (PUC), devises data augmentation strategy.
result PUC-compliant models can improve performance without disadvantaging opt-out users.
The study examines how investor protection and past information affect stock returns and interest rates.
problem Empirical regularities related to investor protection and past information in asset pricing models.
method Developed a dynamic asset pricing model with a controlling shareholder and good/bad memory in budget dynamics.
result Good/bad memory of investors on historical market information affects stock returns and interest rates, strengthening investor protection in high ownership concentration.
ARL improves fairness without protected features, showing AUC improvements for worst-case groups.
problem Training fairness in ML without known protected features.
method Adversarially Reweighted Learning (ARL) using non-protected features and task labels.
result ARL improves Rawlsian Max-Min fairness with notable AUC improvements for worst-case groups.
A distributed framework protects privacy while maintaining fairness in machine learning.
problem Protecting personal demographic data while ensuring fair machine learning outcomes.
method A distributed framework with private third-party data communication, ensuring privacy and fairness.
result Four fair learning methods consistently outperform existing ones in fairness and accuracy across three real-world datasets.
The paper tackles fairness in classification by learning fair latent representations.
problem Fairness issues in classification algorithms used in societally critical domains.
method Develops a minimax adversarial framework to learn fair latent representations.
result The framework provides theoretical guarantees for statistical parity and individual fairness.
Proposes a new method for fairness in machine learning with multiple protected attributes.
problem Ensuring fairness in machine learning models with continuous and multiple protected attributes.
method Distance covariance regularisation framework to mitigate association between model predictions and protected attributes.
result Demonstrates effectiveness in mitigating fairness gerrymandering in regression tasks.
New algorithm mitigates bias in subset selection with noisy protected attributes.
problem Mitigating bias in subset selection when protected attributes are noisy.
method Formulated a denoised selection problem and developed a linear-programming based approximation algorithm.
result The approach can produce fairer subsets despite noisy protected attributes.
Adds layers to NNs to protect them from reverse engineering.
problem Extracting the underlying model of a Neural Network.
method Introducing parasitic layers that approximate a noisy identity mapping with a Convolutional NN.
result The protected NN's predictions remain mostly unchanged while making reverse-engineering more complex.
DPLP predicts links while protecting some node-pairs' privacy.
problem Link prediction with protected connections in private networks.
method DPLP uses differential privacy on graphs to protect node-pairs, applying a monotone transform and noise to base scores.
result DPLP effectively balances privacy and link prediction accuracy.
Paper explores GAN generalization via privacy protection, proving bounds on generalization gap and reducing leakage.
problem Understanding and bounding the generalization gap of GANs.
method Theoretical proof using differential privacy, reinterpreting Bayesian GAN, membership attacks.
result Proven bounds on generalization gap and reduced information leakage.