Personal Assistant Systems
Ikea's Dirigera smart hub just got a big Matter boost
It's been more than a year since Ikea's smart hub got a Matter update, but up until now, the Dirigea hub could only act as a bridge between Ikea devices and existing Matter networks. That's about to change thanks to a just-released firmware update. Dirigea firmware update 2.805.6 gives the Dirigea hub Matter controller capabilities, meaning it can now discover and take charge of Matter devices, including those from third-party manufacturers. The firmware update was confirmed by an Ikea rep on Reddit. Previously, the Dirigera hub could only expose Ikea devices to other Matter controllers, such as the Apple HomePod mini, the Amazon Echo, and the Google Nest Hub.
How to Use Voice Typing on Your Phone
With the rise of AI assistants like Siri, Alexa, and Gemini, we're all now well used to talking to our gadgets. But what you might not realize is that you can actually talk to type anywhere that a text-input box pops up. This can come in handy in a variety of situations--perhaps you've got your hands full of groceries, or you're holding onto a subway rail. Maybe your phone is out of reach, or the screen's cracked and keyboard doesn't work as well as it should. Or maybe being hunched over a tiny screen to compose a message is just not your idea of fun.
ManifoldMind: Dynamic Hyperbolic Reasoning for Trustworthy Recommendations
Harit, Anoushka, Sun, Zhongtian, Hadzidedic, Suncica
We introduce ManifoldMind, a probabilistic geometric recommender system for exploratory reasoning over semantic hierarchies in hyperbolic space. Unlike prior methods with fixed curvature and rigid embeddings, ManifoldMind represents users, items, and tags as adaptive-curvature probabilistic spheres, enabling personalised uncertainty modeling and geometry-aware semantic exploration. A curvature-aware semantic kernel supports soft, multi-hop inference, allowing the model to explore diverse conceptual paths instead of overfitting to shallow or direct interactions. Experiments on four public benchmarks show superior NDCG, calibration, and diversity compared to strong baselines. ManifoldMind produces explicit reasoning traces, enabling transparent, trustworthy, and exploration-driven recommendations in sparse or abstract domains.
Content filtering methods for music recommendation: A review
Zeng, Terence, Umrawal, Abhishek K.
Recommendation systems have become essential in modern music streaming platforms, shaping how users discover and engage with songs. One common approach in recommendation systems is collaborative filtering, which suggests content based on the preferences of users with similar listening patterns to the target user. However, this method is less effective on media where interactions are sparse. Music is one such medium, since the average user of a music streaming service will never listen to the vast majority of tracks. Due to this sparsity, there are several challenges that have to be addressed with other methods. This review examines the current state of research in addressing these challenges, with an emphasis on the role of content filtering in mitigating biases inherent in collaborative filtering approaches. We explore various methods of song classification for content filtering, including lyrical analysis using Large Language Models (LLMs) and audio signal processing techniques. Additionally, we discuss the potential conflicts between these different analysis methods and propose avenues for resolving such discrepancies.
Why Multi-Interest Fairness Matters: Hypergraph Contrastive Multi-Interest Learning for Fair Conversational Recommender System
Zheng, Yongsen, Xie, Zongxuan, Wang, Guohua, Liu, Ziyao, Lin, Liang, Lam, Kwok-Yan
Unfairness is a well-known challenge in Recommender Systems (RSs), often resulting in biased outcomes that disadvantage users or items based on attributes such as gender, race, age, or popularity. Although some approaches have started to improve fairness recommendation in offline or static contexts, the issue of unfairness often exacerbates over time, leading to significant problems like the Matthew effect, filter bubbles, and echo chambers. To address these challenges, we proposed a novel framework, Hypergraph Contrastive Multi-Interest Learning for Fair Conversational Recommender System (HyFairCRS), aiming to promote multi-interest diversity fairness in dynamic and interactive Conversational Recommender Systems (CRSs). HyFairCRS first captures a wide range of user interests by establishing diverse hypergraphs through contrastive learning. These interests are then utilized in conversations to generate informative responses and ensure fair item predictions within the dynamic user-system feedback loop. Experiments on two CRS-based datasets show that HyFairCRS achieves a new state-of-the-art performance while effectively alleviating unfairness. Our code is available at https://github.com/zysensmile/HyFairCRS.
The Echo Spot hits its best price ahead of Prime Day, now 44% off
Prime Day is just days away and we're already reveling in the early deals we're spotting. Here's one such deal: the gorgeous Amazon Echo Spot has been slashed down to just 45. That's 44% off its 80 MSRP and matches the best price it's ever been. The 2024 version of the Echo Spot has a sleek redesign that sets it apart from previous models. Instead of the big speaker we normally associate with the Echo line, this one is more of a proper digital display with the speaker as more of a supplement.
Far From Sight, Far From Mind: Inverse Distance Weighting for Graph Federated Recommendation
Khouas, Aymen Rayane, Bouadjenek, Mohamed Reda, Hacid, Hakim, Aryal, Sunil
Graph federated recommendation systems offer a privacy-preserving alternative to traditional centralized recommendation architectures, which often raise concerns about data security. While federated learning enables personalized recommendations without exposing raw user data, existing aggregation methods overlook the unique properties of user embeddings in this setting. Indeed, traditional aggregation methods fail to account for their complexity and the critical role of user similarity in recommendation effectiveness. Moreover, evolving user interactions require adaptive aggregation while preserving the influence of high-relevance anchor users (the primary users before expansion in graph-based frameworks). To address these limitations, we introduce Dist-FedAvg, a novel distance-based aggregation method designed to enhance personalization and aggregation efficiency in graph federated learning. Our method assigns higher aggregation weights to users with similar embeddings, while ensuring that anchor users retain significant influence in local updates. Empirical evaluations on multiple datasets demonstrate that Dist-FedAvg consistently outperforms baseline aggregation techniques, improving recommendation accuracy while maintaining seamless integration into existing federated learning frameworks.
Optimizing Conversational Product Recommendation via Reinforcement Learning
We propose a reinforcement learning-based approach to optimize conversational strategies for product recommendation across diverse industries. As organizations increasingly adopt intelligent agents to support sales and service operations, the effectiveness of a conversation hinges not only on what is recommended but how and when recommendations are delivered. We explore a methodology where agentic systems learn optimal dialogue policies through feedback-driven reinforcement learning. By mining aggregate behavioral patterns and conversion outcomes, our approach enables agents to refine talk tracks that drive higher engagement and product uptake, while adhering to contextual and regulatory constraints. We outline the conceptual framework, highlight key innovations, and discuss the implications for scalable, personalized recommendation in enterprise environments.
Enhanced Influence-aware Group Recommendation for Online Media Propagation
He, Chengkun, Zhou, Xiangmin, Wang, Chen, Cao, Longbing, Shao, Jie, Li, Xiaodong, Xu, Guang, Hu, Carrie Jinqiu, Tari, Zahir
Group recommendation over social media streams has attracted significant attention due to its wide applications in domains such as e-commerce, entertainment, and online news broadcasting. By leveraging social connections and group behaviours, group recommendation (GR) aims to provide more accurate and engaging content to a set of users rather than individuals. Recently, influence-aware GR has emerged as a promising direction, as it considers the impact of social influence on group decision-making. In earlier work, we proposed Influence-aware Group Recommendation (IGR) to solve this task. However, this task remains challenging due to three key factors: the large and ever-growing scale of social graphs, the inherently dynamic nature of influence propagation within user groups, and the high computational overhead of real-time group-item matching. To tackle these issues, we propose an Enhanced Influence-aware Group Recommendation (EIGR) framework. First, we introduce a Graph Extraction-based Sampling (GES) strategy to minimise redundancy across multiple temporal social graphs and effectively capture the evolving dynamics of both groups and items. Second, we design a novel DYnamic Independent Cascade (DYIC) model to predict how influence propagates over time across social items and user groups. Finally, we develop a two-level hash-based User Group Index (UG-Index) to efficiently organise user groups and enable real-time recommendation generation. Extensive experiments on real-world datasets demonstrate that our proposed framework, EIGR, consistently outperforms state-of-the-art baselines in both effectiveness and efficiency.
When Less Is More: Binary Feedback Can Outperform Ordinal Comparisons in Ranking Recovery
Xu, Shirong, Zhang, Jingnan, Wang, Junhui
Paired comparison data, where users evaluate items in pairs, play a central role in ranking and preference learning tasks. While ordinal comparison data intuitively offer richer information than binary comparisons, this paper challenges that conventional wisdom. We propose a general parametric framework for modeling ordinal paired comparisons without ties. The model adopts a generalized additive structure, featuring a link function that quantifies the preference difference between two items and a pattern function that governs the distribution over ordinal response levels. This framework encompasses classical binary comparison models as special cases, by treating binary responses as binarized versions of ordinal data. Within this framework, we show that binarizing ordinal data can significantly improve the accuracy of ranking recovery. Specifically, we prove that under the counting algorithm, the ranking error associated with binary comparisons exhibits a faster exponential convergence rate than that of ordinal data. Furthermore, we characterize a substantial performance gap between binary and ordinal data in terms of a signal-to-noise ratio (SNR) determined by the pattern function. We identify the pattern function that minimizes the SNR and maximizes the benefit of binarization. Extensive simulations and a real application on the MovieLens dataset further corroborate our theoretical findings.