Study analyzes online abuse against women journalists and politicians on Twitter.
problem Online abuse against women journalists and politicians on Twitter.
method Crowdsourced analysis of a curated dataset of labeled tweets, accounting for variability in abuse perception.
result Technical backbone for raising awareness and improving social media standards.
Paper detects review abuse using tensor decomposition.
problem Detecting review abuse by sellers and reviewers.
method Semi-supervised binary multi-target tensor decomposition.
result The model achieves higher precision and recall.
Automated scoring engines are increasingly being used to score the free-form text responses that students give to questions. Such engines are not designed to appropriately deal with responses that a human reader would find alarming such as those that indicate an intention to self-harm or harm others, responses that all…
LLMs can identify tax strategies, potentially revolutionizing tax enforcement.
problem Detecting and analyzing U.S. tax-minimization strategies.
method Evaluated advanced LLMs on interpreting, verifying, and generating tax strategies.
result Identified a novel tax strategy, showing LLMs' potential in tax enforcement.
Study uses attention-based method to detect different types of online harassment.
problem Detecting different types of online harassment in social media content.
method Multi-attention based approach using Recurrent Neural Networks to address imbalanced data.
result Demonstrates effectiveness of attention-based mechanism for detecting various types of online harassment.
Mitigates bias in text classification by weighting instances.
problem Unintended biases in text classification datasets based on demographic terms.
method Instance weighting to recover non-discrimination distribution.
result Effective mitigation of unintended biases without sacrificing generalization.
HMS-BERT detects cyberbullying in multiple languages and labels.
problem Multilingual and multi-label cyberbullying detection challenges.
method Hybrid multi-task self-training framework using BERT.
result Strong performance on multi-label and main classification tasks.
Project classifies Hinglish social content on platforms like Twitter, Reddit.
problem Classifying abusive and hate-inducing content in Hinglish on social media.
method Used deep learning with bi-directional sequence models and text augmentation techniques.
result Produced a state-of-the-art classifier that outperforms previous work.
A dataset for detecting online hate speech from YouTube and Reddit comments.
problem Detecting and preventing hate speech on social media platforms.
method Created a dataset with two variants: binary and multi-label, based on YouTube and Reddit comments, using Figure-Eight crowdsourcing platform.
result Demonstrated that even a small amount of labelled data can help detect hate speech occurrences.
A framework for flagging content with limited data.
problem Content flagging with scarce target-language data.
method Nearest-neighbor architecture using Transformer representations.
result Significant performance improvements over prior work.
Despite the great success achieved in machine learning (ML), adversarial examples have caused concerns with regards to its trustworthiness: A small perturbation of an input results in an arbitrary failure of an otherwise seemingly well-trained ML model. While studies are being conducted to discover the intrinsic proper…
Study uses machine learning to analyze state drug policies and reduce overdose deaths.
problem Epidemic opioid overdose rates and ineffective state-level policies.
method Hierarchical clustering of 138 binomial variables to generate policy bundles, then regression analysis.
result Balancing certain policies leads to reduced overdose deaths, but only after second year.
Grale designs graphs for graph learning, improving performance on large datasets.
problem Finding the right graph for semi-supervised learning with billions of nodes.
method Fuses multiple similarity measures using locality sensitive hashing to create task-specific graphs.
result Grale detects a large number of malicious actors, increasing recall by 89%.
Perceptual ad-blocking is a novel approach that detects online advertisements based on their visual content. Compared to traditional filter lists, the use of perceptual signals is believed to be less prone to an arms race with web publishers and ad networks. We demonstrate that this may not be the case. We describe att…
A text mining approach is proposed based on latent Dirichlet allocation (LDA) to analyze the Consumer Financial Protection Bureau (CFPB) consumer complaints. The proposed approach aims to extract latent topics in the CFPB complaint narratives, and explores their associated trends over time. The time trends will then be…
This review is about the convenience, the benefits, as well as the destructive capacities of money. It deals with various aspects of money creation, with its value, and its appropriation. All sorts of money tend to get corrupted by eventually creating too much of them. In the long run, this renders money worthless and …
In this paper (S_n) is a sequence of surfaces immersed in a 4-manifold which converges to a branched surface S_0. Up to sign, μ^T_p (resp. μ^N_p) will denote the amount of curvature of the tangent bundles TS_n (resp. the normal bundles NS_n) which concentrates around a singular point p of S_0 when n goes to infinity. B…
Method detects insider trading using trading data and dimensionality reduction.
problem Identifying insider trading in large datasets.
method Unsupervised machine learning, principal component analysis, autoencoders.
result Identifies suspicious trading behavior based on reconstruction errors.
New algorithm prevents strategic replication in multi-armed bandit problems.
problem Strategic replication by agents can exploit bandit algorithms' balance.
method Designs Hierarchical UCB (H-UCB) and Robust Hierarchical UCB (RH-UCB) algorithms.
result Achieves O(lnT)-regret and sublinear regret in realistic scenarios. Researchers propose better probabilistic models for deep learning.
problem Using cross-entropy loss for non-categorical data.
method Introducing continuous-categorical distribution and proposing probabilistic alternatives.
result Potential for outperformance in deep learning models with proper probabilistic treatment.
Excessive leverage, i.e. the abuse of debt financing, is considered one of the primary factors in the default of financial institutions. Systemic risk results from correlations between individual default probabilities that cannot be considered independent. Based on the structural framework by Merton (1974), we discuss …
Framework identifies comorbidities for frequent ED and inpatient visits.
problem Reducing resource usage and costs in frequent patients.
method Developed MSAR algorithm to identify comorbidities.
result MSAR identifies conditions most associated with reoccurring ED and inpatient visits.
Paper tackles toxic comment detection using deep learning.
problem Automatic detection of toxic comments on the internet.
method Designs binary classification and regression-based approaches using DNN.
result BERT fine-tuning outperforms other methods.
Detects organized fraudsters in insurance claims with high precision.
problem Fraudulent insurance claims lead to heavy financial losses.
method Developed a novel data-driven procedure using graph learning algorithms.
result Achieves more than 80% precision in fraud detection.
Two machine learning methods detect insider trading from investor activity data.
problem Detecting insider trading from trading activity data is challenging.
method Two unsupervised machine learning methods: clustering and group identification.
result Identifies potential insider trading rings around price sensitive events.
Through a short sale, a person borrows a share of stock from a lender, sells the borrowed share to a third person at the current price, and purchases an identical share in the market at a future date and at a future price to replace the borrowed share of stock. This only makes sense if the short seller anticipates a do…
Confidential Guardian prevents model abstention from being used to discriminate.
problem Dishonest institutions can exploit machine learning model abstention to unfairly deny services.
method Confidential Guardian uses zero-knowledge proofs to verify model confidence and detect suppression.
result Confidential Guardian effectively prevents the misuse of cautious predictions.
Study shows it's hard to detect when a decision-maker fakes fairness using a specific sampling technique.
problem Detecting when decision-makers fake fairness using auditing tools.
method Developed a stealthily biased sampling algorithm to construct deceptive benchmark datasets.
result The constructed deceptive datasets are difficult to detect, making it hard to avoid fake fairness.
Due to economic globalization, each country's economic law, including tax laws and tax treaties, has been forced to work as a single network. However, each jurisdiction (country or region) has not made its economic law under the assumption that its law functions as an element of one network, so it has brought unexpecte…
Paper presents attacks on real-time object detection systems.
problem Adversarial attacks on real-time object detection systems.
method Three targeted adversarial Objectness Gradient attacks (TOG).
result Adversarial attacks can cause object-vanishing, object-fabrication, and object-mislabeling.
Advances in machine learning have led to broad deployment of systems with impressive performance on important problems. Nonetheless, these systems can be induced to make errors on data that are surprisingly similar to examples the learned system handles correctly. The existence of these errors raises a variety of quest…
Online boosting method improves weak to strong learner.
problem Online learning of weak to strong learner.
method Extends batch GentleAdaBoost to online approach with line search.
result Online boosting performs better than other methods.
RNNs are vulnerable to adversarial attacks, especially in network traffic.
problem Adversarial attacks on RNNs for IDSs in network traffic.
method Developed new explainability techniques and ARS for comparing IDSs.
result RNNs are vulnerable to adversarial attacks, even in sequential data.
Paper tackles online optimization with memory and competitive control.
problem Minimizing hitting and switching costs in online optimization problems.
method Optimistic Regularized Online Balanced Descent algorithm.
result Achieves a constant, dimension-free competitive ratio.
Study on computable online learning with new conditions and complexities.
problem Characterizing optimal online learning under varying optimality requirements.
method Introduced anytime optimal (a-optimal) online learning and explored computational separations.
result Found a computational separation between a-optimal and optimal online learning.
We study the task of online boosting--combining online weak learners into an online strong learner. While batch boosting has a sound theoretical foundation, online boosting deserves more study from the theoretical perspective. In this paper, we carefully compare the differences between online and batch boosting, and pr…
Proposes an online method for high-dimensional streaming data.
problem Increasing variable dimensions with sample size in online kernel sliced inverse regression.
method Introduces approximate linear dependence condition and dictionary variable sets to address the problem. Transforms into online generalized eigen-decomposition problem and uses stochastic optimization for updates.
result Achieves close performance to batch processing kernel sliced inverse regression.
Boosts weak online learners to strong ones with sublinear regret.
problem Online learning agnostic setting without strong guarantees.
method Reduction to online convex optimization, boosting via marginally-better-than-trivial regret guarantees.
result First agnostic online boosting algorithm with sublinear regret.
Improved online classification with accurate predictions.
problem Online classification challenges with limited data.
method Designing an online learner that uses predictions to reduce regret.
result Expected regret is better than worst-case analysis, especially with accurate predictions.
Continuous-time algorithms improve online learning performance.
problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.
Extends boosting to multiclass online agnostic classification.
problem Online multiclass classification with weak learners.
method Reduces multiclass online agnostic boosting to online convex optimization.
result First boosting algorithm for online agnostic multiclass classification.
Indirect attacks can fool graph classifiers even with poisoned neighbors.
problem How to evaluate and defend graph convolutional neural networks against indirect adversarial attacks.
method Proposed a method to generate adversarial perturbations on a single node far from the target.
result 99% attack success rate within two-hops from the target in two datasets.
Online learning improves big data accuracy quickly.
problem Heterogeneity in big data analysis.
method Online machine learning for big data.
result Online learning converges quickly to batch accuracy.
New private algorithms for online learning improve regret in high privacy regimes.
problem Private online learning from experts and convex optimization.
method Transformed lazy algorithms for differential privacy.
result Improved regret bounds for DP-OPE and DP-OCO.
Online-iForest detects anomalies in streaming data efficiently.
problem Offline anomaly detection methods are impractical for streaming contexts.
method Online-iForest tracks evolving data processes in real-time without periodic retraining.
result Online-iForest outperforms all competitors in efficiency.
Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.
problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.
Transforms offline algorithms to online with low regret in random order model.
problem Developing online algorithms with low approximate regret from offline approximation algorithms.
method General reduction theorem and coreset construction method.
result Achieves polylogarithmic ε-approximate regret for various online problems.
New setup for continuous online learning improves understanding of imitation learning.
problem Challenges in capturing regularity in online problems.
method Continuous Online Learning (COL) setup, focusing on continuous gradient changes.
result Fundamental equivalence between sublinear dynamic regret and solving certain EPs.