Deep Q-Learning for Long-Term Connection Recommendations

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Online connection networks face challenges in accurately recommending connections due to their dynamic nature and fluctuations in member preferences, often focusing on short-term rewards and limited feedback, which hinders the prediction of long-term interactions.

Innovation Solution

A deep Q-learning method is employed to improve connection suggestions by using a reinforcement-based framework that models long-term rewards through a state-based sequential algorithm, incorporating implicit feedback and temporal-difference learning to optimize the selection of recommended connections.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If the online connection system focuses on short-term reward values (e.g., click-through rate) for recommending connections, then the immediate engagement metrics improve, but the long-term interaction quality and relationship sustainability deteriorate

Engineering Contradiction:
Improveclick-through rateVSAvoidlong-term interaction quality
Core Design Contradiction:
ProductivityVSDuration of action of moving object

Solution Approach 1:

The system performs preliminary analysis of member profiles, interaction histories, and compatibility factors before making connection recommendations. By pre-processing and storing relevant member data, preference patterns, and interaction outcomes in advance, the system can evaluate both short-term click-through potential and long-term relationship sustainability without sacrificing immediate engagement metrics

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The recommendation system dynamically adjusts its evaluation criteria by incorporating temporal factors that balance short-term and long-term rewards. The system adapts recommendation strategies based on real-time feedback from member interactions, learning from both immediate click-through behavior and sustained engagement patterns over time, allowing it to optimize for both productivity and duration

Inventive Principle:
Principle #15Dynamics

2Device complexity

If the online connection system collects only limited member feedback (e.g., click or no-click) for recommendation accuracy, then the data collection process remains simple, but the prediction accuracy for long-term interactions deteriorates

Engineering Contradiction:
Improvefeedback collection complexityVSAvoidlong-term interaction prediction accuracy
Core Design Contradiction:
Device complexityVSMeasurement precision

Solution Approach 1:

The system implements a comprehensive feedback mechanism that collects multiple types of interaction data beyond simple click/no-click responses. This includes tracking message exchanges, call durations, meeting schedules, and ongoing interaction patterns. The accumulated feedback data is continuously used to refine recommendation algorithms, improving long-term prediction accuracy while maintaining manageable data collection processes through automated tracking

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The system expands the feedback dimensionality by incorporating implicit feedback signals such as time spent viewing profiles, number of messages exchanged, duration of conversations, and frequency of interactions. These additional dimensions of feedback provide richer information about member preferences and interaction quality without significantly increasing collection complexity, enabling more accurate long-term predictions

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

3Device complexity

If the online connection network uses traditional recommendation methods based on limited data sets, then the system complexity remains low, but the accuracy of connection recommendations deteriorates in dynamic environments

Engineering Contradiction:
Improvesystem complexityVSAvoidconnection recommendation accuracy
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The system dynamically changes key parameters including member preference weights, compatibility thresholds, and recommendation priorities based on real-time data analysis. By continuously adjusting these parameters according to observed interaction patterns and feedback, the system maintains high recommendation accuracy in dynamic environments while avoiding the need for completely complex retraining of recommendation models

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The system performs preliminary processing and storage of member profiles, interaction histories, and compatibility metrics before recommendation generation. By pre-computing and caching relevant data, the system reduces the complexity of real-time recommendation calculations while improving accuracy through comprehensive data analysis, allowing complex preprocessing to be done offline before simple real-time matching

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11620595B2Deep reinforcement learning for long term rewards in an online connection network
Publication Date: 2023.04.04 MICROSOFT TECHNOLOGY LICENSING LLC
  • US11620595B2 patent drawing
  • US11620595B2 patent drawing
  • US11620595B2 patent drawing

AI summary

An online connection server is configured to more accurately predict connections for a viewing member of an online connection network. The online connection server may implement a machine-learning model that uses prior interactions by the viewing member to determine those connections that are likely to lead to more substantial interactions with the viewing member. The machine-learning model may be implemented using a reinforcement learning technique, such as a Deep Q network. The online connection server may further implement a state representation module that generates a state from a graph-based embedding of the viewing member profile, where the state is used to train the machine-learning model and determine an optimal candidate to recommend as a connection for the viewing member.