Goto

Collaborating Authors

 relationship


An AI companion company is hiring a human therapist

Mashable

Look Up Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Say More Safety Net Creator Hub Versus Gift Ideas For Everyone On Your List Mashable Selects Switch Off Trending Now In My Bag VidCon with Mashable All Series The job is to help people in relationships with AI bots. Anna Iovine is the associate editor of features at Mashable. Previously, as the sex and relationships reporter, she covered topics ranging from dating apps to pelvic pain. Before Mashable, Anna was a social editor at VICE and freelanced for publications such as Slate and the Columbia Journalism Review. Follow her on Bluesky .


I tested the best dating apps for women: Find a real connection in 2026

Mashable

Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Look Up Say More Safety Net Creator Hub Versus Gift Ideas For Everyone On Your List Mashable Selects Switch Off Trending Now In My Bag VidCon with Mashable All Series We tested the safest, most effective apps for finding a real partner. Tabitha Britt is an award-winning freelance journalist, editor, and SEO/AEO strategist. Aside from reviewing dating apps and sex toys for Mashable, Tabitha is also the founding editor-in-chief of DO YOU ENDO -- a digital magazine by individuals with endometriosis, for individuals with endometriosis. She has a Master's degree in Creative Publishing and Critical Journalism from The New School for Social Research and is a grad of Sextech School. You can find more of her work in various online publications, including,, and . Editors and writers independently select products unless marked Sponsored or Promoted. Sponsored content is a paid ad, while content marked Promoted is chosen by Ziff Davis leadership. We may earn an affiliate commission if you buy through our links. Promoted cards do not include input from individual authors. These are the tech, tools, and products -- from laptops to e-readers, from earbuds to robovacs, and more -- that Mashable ranks best in class. Being a woman on the internet has never been easy, but trying to find a genuine connection on a dating app in 2026? Between the emboldened creeps, the swipe fatigue, and surprisingly convincing AI profiles, it's enough to make you wonder if applying for is the more sane alternative. The reality is, dating right now comes with a set of challenges --especially when it comes to safety. A 2026 survey from SSRS found that 55 percent of women believe meeting someone in person from a dating app is unsafe, compared to just 30 percent of men. We're dealing with a constant barrage of low-effort hey messages, unsolicited dick pics, men who are married, and the underlying safety concerns men just don't have to think about .


Why Bumble now allows men to message first

Mashable

Mashable's Best: E-readers, robovacs, laptops, earbuds, smart home and more Look Up Say More Creator Hub Gift Ideas For Everyone On Your List Mashable Selects Versus Switch Off Trending Now Safety Net In My Bag VidCon with Mashable All Series A massive update comes to Bumble today. Anna Iovine is the associate editor of features at Mashable. Previously, as the sex and relationships reporter, she covered topics ranging from dating apps to pelvic pain. Before Mashable, Anna was a social editor at VICE and freelanced for publications such as Slate and the Columbia Journalism Review. Follow her on Bluesky .


Exploiting the Relationship Between Kendall's Rank Correlation and Cosine Similarity for Attribution Protection

Neural Information Processing Systems

Model attributions are important in deep neural networks as they aid practitioners in understanding the models, but recent studies reveal that attributions can be easily perturbed by adding imperceptible noise to the input. The non-differentiable Kendall's rank correlation is a key performance index for attribution protection. In this paper, we first show that the expected Kendall's rank correlation is positively correlated to cosine similarity and then indicate that the direction of attribution is the key to attribution robustness. Based on these findings, we explore the vector space of attribution to explain the shortcomings of attribution defense methods using $\ell_p$ norm and propose integrated gradient regularizer (IGR), which maximizes the cosine similarity between natural and perturbed attributions. Our analysis further exposes that IGR encourages neurons with the same activation states for natural samples and the corresponding perturbed samples. Our experiments on different models and datasets confirm our analysis on attribution protection and demonstrate a decent improvement in adversarial robustness.


Improving Calibration through the Relationship with Adversarial Robustness

Neural Information Processing Systems

Neural networks lack adversarial robustness, i.e., they are vulnerable to adversarial examples that through small perturbations to inputs cause incorrect predictions. Further, trust is undermined when models give miscalibrated predictions, i.e., the predicted probability is not a good indicator of how much we should trust our model. In this paper, we study the connection between adversarial robustness and calibration and find that the inputs for which the model is sensitive to small perturbations (are easily attacked) are more likely to have poorly calibrated predictions. Based on this insight, we examine if calibration can be improved by addressing those adversarially unrobust inputs. To this end, we propose Adversarial Robustness based Adaptive Label Smoothing (AR-AdaLS) that integrates the correlations of adversarial robustness and calibration into training by adaptively softening labels for an example based on how easily it can be attacked by an adversary. We find that our method, taking the adversarial robustness of the in-distribution data into consideration, leads to better calibration over the model even under distributional shifts. In addition, AR-AdaLS can also be applied to an ensemble model to further improve model calibration.


Unsupervised Topic Models are Data Mixers for Pre-training Language Models

arXiv.org Artificial Intelligence

The performance of large language models (LLMs) is significantly affected by the quality and composition of their pre-training data, which is inherently diverse, spanning various domains, sources, and topics. Effectively integrating these heterogeneous data sources is crucial for optimizing LLM performance. Previous research has predominantly concentrated on domain-based data mixing, often neglecting the nuanced topic-level characteristics of the data. To address this gap, we propose a simple yet effective topic-based data mixing strategy that utilizes fine-grained topics generated through our topic modeling method, DataWeave. DataWeave employs a multi-stage clustering process to group semantically similar documents and utilizes LLMs to generate detailed topics, thereby facilitating a more nuanced understanding of dataset composition. Our strategy employs heuristic methods to upsample or downsample specific topics, which significantly enhances LLM performance on downstream tasks, achieving superior results compared to previous, more complex data mixing approaches. Furthermore, we confirm that the topics Science and Relationships are particularly effective, yielding the most substantial performance improvements. We will make our code and datasets publicly available.


Reviews: Extracting Relationships by Multi-Domain Matching

Neural Information Processing Systems

Title: Extracting Relationships by Multi-Domain Matching Summary Assuming that a corpus is compiled from many sources belonging to different to domains, of which only a strict subset of domains is suitable to learn how to do prediction in a target domain, this paper proposes a novel approach (called Multiple Domain Matching Network (MDMN)) that aims at learning which domains share strong statistical relationships, and which source domains are best at supporting to learn the target domain prediction tasks. While many approaches to multiple-domain adaptation aim to match the feature-space distribution of *every* source domain to that of the target space, this paper suggests to not only map the distribution between sources and target, but also *within* source domains. The latter allows for identifying subsets of source domains that share a strong statistical relationship. Strengths Paper provides a theoretical analysis that yields a tighter bound on the weighted multi-source discrepancy. Weaknesses Tighter bound on multi-source discrepancy depends on the assumption that source domains that are less relevant for the target domain have lower weights.


QueryAgent: A Reliable and Efficient Reasoning Framework with Environmental Feedback-based Self-Correction

arXiv.org Artificial Intelligence

Employing Large Language Models (LLMs) for semantic parsing has achieved remarkable success. However, we find existing methods fall short in terms of reliability and efficiency when hallucinations are encountered. In this paper, we address these challenges with a framework called QueryAgent, which solves a question step-by-step and performs step-wise self-correction. We introduce an environmental feedback-based self-correction method called ERASER. Unlike traditional approaches, ERASER leverages rich environmental feedback in the intermediate steps to perform selective and differentiated self-correction only when necessary. Experimental results demonstrate that QueryAgent notably outperforms all previous few-shot methods using only one example on GrailQA and GraphQ by 7.0 and 15.0 F1. Moreover, our approach exhibits superiority in terms of efficiency, including runtime, query overhead, and API invocation costs. By leveraging ERASER, we further improve another baseline (i.e., AgentBench) by approximately 10 points, revealing the strong transferability of our approach.


Copyleft for Alleviating AIGC Copyright Dilemma: What-if Analysis, Public Perception and Implications

arXiv.org Artificial Intelligence

As AIGC has impacted our society profoundly in the past years, ethical issues have received tremendous attention. The most urgent one is the AIGC copyright dilemma, which can immensely stifle the development of AIGC and greatly cost the entire society. Given the complexity of AIGC copyright governance and the fact that no perfect solution currently exists, previous work advocated copyleft on AI governance but without substantive analysis. In this paper, we take a step further to explore the feasibility of copyleft to alleviate the AIGC copyright dilemma. We conduct a mixed-methods study from two aspects: qualitatively, we use a formal what-if analysis to clarify the dilemma and provide case studies to show the feasibility of copyleft; quantitatively, we perform a carefully designed survey to find out how the public feels about copylefting AIGC. The key findings include: a) people generally perceive the dilemma, b) they prefer to use authorized AIGC under loose restriction, and c) they are positive to copyleft in AIGC and willing to use it in the future.


Banking's One-to-One Future is Finally Possible

#artificialintelligence

Almost a quarter century ago, a book was written about how organizations would focus on share of customer as opposed to share of market, building a personalized collaboration driven by big data. With advanced analytics, banking may finally getting close to realizing this vision. In 1993, a then revolutionary book, "The One to One Future: Building Relationships One Customer at a Time" was published, proposing the idea that as technology makes it affordable to track individual customers, marketing shifts from finding customers for products to finding products for customers. According to the authors, Don Peppers and Martha Rogers, Ph.D., a company could use technology to gather information about, and to communicate directly with, individuals to form a commercial bond. The book became a bestseller, and was on every marketer's bookshelf … almost a quarter century ago.