Goto

Collaborating Authors

 Personal Assistant Systems


Exponential Family Embeddings

Neural Information Processing Systems

In this paper, we develop exponential family embeddings, a class of methods that extends the idea of word embeddings to other types of high-dimensional data. As examples, we studied neural data with real-valued observations, count data from a market basket analysis, and ratings data from a movie recommendation system. The main idea is to model each observation conditioned on a set of other observations.


Fast Distributed Submodular Cover: Public-Private Data Summarization

Neural Information Processing Systems

In this paper, we introduce the public-private framework of data summarization motivated by privacy concerns in personalized recommender systems and online social services. Such systems have usually access to massive data generated by a large pool of users. A major fraction of the data is public and is visible to (and can be used for) all users. However, each user can also contribute some private data that should not be shared with other users to ensure her privacy. The goal is to provide a succinct summary of massive dataset, ideally as small as possible, from which customized summaries can be built for each user, i.e. it can contain elements from the public data (for diversity) and users' private data (for personalization). To formalize the above challenge, we assume that the scoring function according to which a user evaluates the utility of her summary satisfies submodularity, a widely used notion in data summarization applications.


User-Creator Feature Polarization in Recommender Systems with Dual Influence

Neural Information Processing Systems

Recommender systems serve the dual purpose of presenting relevant content to users and helping content creators reach their target audience. The dual nature of these systems naturally influences both users and creators: users' preferences are affected by the items they are recommended, while creators may be incentivized to alter their content to attract more users. We define a model, called user-creator feature dynamics, to capture the dual influence of recommender systems. We prove that a recommender system with dual influence is guaranteed to polarize, causing diversity loss in the system. We then investigate, both theoretically and empirically, approaches for mitigating polarization and promoting diversity in recommender systems. Unexpectedly, we find that common diversity-promoting approaches do not work in the presence of dual influence, while relevancy-optimizing methods like top-$k$ truncation can prevent polarization and improve diversity of the system.


Understanding and Improving Adversarial Collaborative Filtering for Robust Recommendation

Neural Information Processing Systems

Adversarial Collaborative Filtering (ACF), which typically applies adversarial perturbations at user and item embeddings through adversarial training, is widely recognized as an effective strategy for enhancing the robustness of Collaborative Filtering (CF) recommender systems against poisoning attacks. Besides, numerous studies have empirically shown that ACF can also improve recommendation performance compared to traditional CF. Despite these empirical successes, the theoretical understanding of ACF's effectiveness in terms of both performance and robustness remains unclear. To bridge this gap, in this paper, we first theoretically show that ACF can achieve a lower recommendation error compared to traditional CF with the same training epochs in both clean and poisoned data contexts. Furthermore, by establishing bounds for reductions in recommendation error during ACF's optimization process, we find that applying personalized magnitudes of perturbation for different users based on their embedding scales can further improve ACF's effectiveness. Building on these theoretical understandings, we propose Personalized Magnitude Adversarial Collaborative Filtering (PamaCF). Extensive experiments demonstrate that PamaCF effectively defends against various types of poisoning attacks while significantly enhancing recommendation performance.


User-item fairness tradeoffs in recommendations

Neural Information Processing Systems

In the basic recommendation paradigm, the most (predicted) relevant item is recommended to each user. This may result in some items receiving lower exposure than they should; to counter this, several algorithmic approaches have been developed to ensure . These approaches necessarily degrade recommendations for some users to improve outcomes for items, leading to concerns. In turn, a recent line of work has focused on developing algorithms for multi-sided fairness, to jointly optimize user fairness, item fairness, and overall recommendation quality. This induces the question: Theoretically, we develop a model of recommendations with user and item fairness objectives and characterize the solutions of fairness-constrained optimization. We identify two phenomena: (a) when user preferences are diverse, there is free item and user fairness; and (b) users whose preferences are misestimated can be disadvantaged by item fairness constraints. Empirically, we prototype a recommendation system for preprints on arXiv and implement our framework, measuring the phenomena in practice and showing how these phenomena inform the of markets with recommendation systems-intermediated matching.


This Matter-compatible smart light switch is 2 for 20 now

PCWorld

When you purchase through links in our articles, we may earn a small commission. The TP-Link Tapo S505 smart light switch is on sale at Amazon. Grab this 2-pack for just $20 while the deal lasts. My smart home life became so much better once I swapped out my old light switches for Tapo ones. The benefits were many, including that I no longer had to get off the couch to turn off the lights--great in the winter when I was already cozy under the blankets!


Can Tinder Fix The Dating Landscape It Helped Ruin?

WIRED

The app reads your email inbox and your meeting calendar, then gives you a short audio summary. It can help you spend less time scrolling, but of course, there are privacy drawbacks to consider.


No luck on Tinder? Scientists reveal why should REMOVE your best qualities from your dating profile - and opt for a story instead

Daily Mail - Science & tech

Pete Hegseth explodes at'Trump Derangement Syndrome' as he claims Iran war is an overwhelming success Pete Hegseth says world should thank Trump as US prepares to unleash'largest strike package' on Iran: Live updates RICHARD EDEN: Everything's going wrong for Harry and Meghan but the Royal Family are not laughing because they will have to take them back Dangerous virus with no treatment or cure is exploding across the US... now alarming new map reveals exactly who is at risk'There was just all this jam. We thought there'd be more to it': ALISON BOSHOFF reveals inside story of how'Meghan has been purged' by Netflix, truth about her'silencing' of Harry, and what the out-in-the-cold couple will do next... Trader Joe's vs Walmart: What your local store really does to your home value and the brand that could knock $17k off your house price Secret life of Heath Ledger's daughter Matilda: She's been hidden for 18 years - but now insiders finally tell of family'secrets'... whispers from ...


Amazon's Echo Spot speaker gets its first discount this year: 38% off

PCWorld

When you purchase through links in our articles, we may earn a small commission. Amazon's Echo Spot speaker gets its first discount this year: 38% off You can get the Echo Spot for just $50 (was $80) right now, close to the best price it's ever been. We're days away from Amazon's Big Spring Sale event and we're already seeing some impressive discounts, especially for the company's own Echo line. For instance, the Echo Spot is down to $50 (was $80). That's the first time it's gone on sale this year and just a few bucks away from its best-ever price.


How Does Message Passing Improve Collaborative Filtering?

Neural Information Processing Systems

Collaborative filtering (CF) has exhibited prominent results for recommender systems and been broadly utilized for real-world applications.A branch of research enhances CF methods by message passing (MP) used in graph neural networks, due to its strong capabilities of extracting knowledge from graph-structured data, like user-item bipartite graphs that naturally exist in CF. They assume that MP helps CF methods in a manner akin to its benefits for graph-based learning tasks in general (e.g., node classification). However, even though MP empirically improves CF, whether or not this assumption is correct still needs verification. To address this gap, we formally investigate why MP helps CF from multiple perspectives and show that many assumptions made by previous works are not entirely accurate. With our curated ablation studies and theoretical analyses, we discover that (i) MP improves the CF performance primarily by additional representations passed from neighbors during the forward pass instead of additional gradient updates to neighbor representations during the model back-propagation and (ii) MP usually helps low-degree nodes more than high-degree nodes.}Utilizing