KS
K.A. Sándor
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
2 records found
1
Multi-Interpretive Multi-Objective Reinforcement Learning
Steerable Alignment Across Different Interpretations of Values
Aligning AI systems with human values is a multi-objective problem, since values such as helpfulness and harmlessness often conflict and the tradeoffs between them must be balanced. Multi-objective reinforcement learning (MORL) addresses this by learning sets of policies that represent these tradeoffs. Values, however, do not come with a single agreed meaning. Objectives such as fairness or professionalism are essentially contested, and different people, groups, and normative theories operationalize the same objective into different reward functions. Existing alignment approaches either commit to one interpretation before training, average conflicting interpretations into a single signal, or represent groups with single-objective reward models. In each case, either the plurality of interpretations or the multi-objective structure of the problem is lost.
This thesis introduces multi-interpretive multi-objective reinforcement learning (MIMORL), which treats the interpretation of the objectives as an explicit dimension of the learning problem. The underlying multi-interpretive multi-objective Markov decision process (MIMOMDP) carries a matrix-valued reward function in which each row is one interpretation of the objectives. Under the assumption that a single theory or opinion guides the interpretation of all objectives together, the preference space factors into a preference over objectives and a preference over interpretations, so that its size grows linearly rather than exponentially with the number of interpretations. Two algorithms are proposed. The outer-loop method trains one multi-objective sub-solver per interpretation and combines their solutions through an interpretation weight, while the inner-loop method conditions a single network on both preference vectors.
Both methods are evaluated in a modified firefighters environment, in which two defensible interpretations of the values professionalism and proximity induce different optimal behaviour, and are compared against specialist, scalarized, and flat multi-objective baselines as well as exactly computed reference solution sets. Both MIMORL variants recover the reference sets on the pure interpretations and on all evaluated mixtures between them, matching the strongest baseline while remaining steerable across interpretations at inference time, with a factored formulation that is theoretically more efficient than the baselines as the number of interpretations grows. A single trained agent can therefore be deployed and steered to different interpretations, or to positions between them, without committing to one reading of its values in advance, which constitutes a step towards pluralistic AI alignment. ...
This thesis introduces multi-interpretive multi-objective reinforcement learning (MIMORL), which treats the interpretation of the objectives as an explicit dimension of the learning problem. The underlying multi-interpretive multi-objective Markov decision process (MIMOMDP) carries a matrix-valued reward function in which each row is one interpretation of the objectives. Under the assumption that a single theory or opinion guides the interpretation of all objectives together, the preference space factors into a preference over objectives and a preference over interpretations, so that its size grows linearly rather than exponentially with the number of interpretations. Two algorithms are proposed. The outer-loop method trains one multi-objective sub-solver per interpretation and combines their solutions through an interpretation weight, while the inner-loop method conditions a single network on both preference vectors.
Both methods are evaluated in a modified firefighters environment, in which two defensible interpretations of the values professionalism and proximity induce different optimal behaviour, and are compared against specialist, scalarized, and flat multi-objective baselines as well as exactly computed reference solution sets. Both MIMORL variants recover the reference sets on the pure interpretations and on all evaluated mixtures between them, matching the strongest baseline while remaining steerable across interpretations at inference time, with a factored formulation that is theoretically more efficient than the baselines as the number of interpretations grows. A single trained agent can therefore be deployed and steered to different interpretations, or to positions between them, without committing to one reading of its values in advance, which constitutes a step towards pluralistic AI alignment. ...
Aligning AI systems with human values is a multi-objective problem, since values such as helpfulness and harmlessness often conflict and the tradeoffs between them must be balanced. Multi-objective reinforcement learning (MORL) addresses this by learning sets of policies that represent these tradeoffs. Values, however, do not come with a single agreed meaning. Objectives such as fairness or professionalism are essentially contested, and different people, groups, and normative theories operationalize the same objective into different reward functions. Existing alignment approaches either commit to one interpretation before training, average conflicting interpretations into a single signal, or represent groups with single-objective reward models. In each case, either the plurality of interpretations or the multi-objective structure of the problem is lost.
This thesis introduces multi-interpretive multi-objective reinforcement learning (MIMORL), which treats the interpretation of the objectives as an explicit dimension of the learning problem. The underlying multi-interpretive multi-objective Markov decision process (MIMOMDP) carries a matrix-valued reward function in which each row is one interpretation of the objectives. Under the assumption that a single theory or opinion guides the interpretation of all objectives together, the preference space factors into a preference over objectives and a preference over interpretations, so that its size grows linearly rather than exponentially with the number of interpretations. Two algorithms are proposed. The outer-loop method trains one multi-objective sub-solver per interpretation and combines their solutions through an interpretation weight, while the inner-loop method conditions a single network on both preference vectors.
Both methods are evaluated in a modified firefighters environment, in which two defensible interpretations of the values professionalism and proximity induce different optimal behaviour, and are compared against specialist, scalarized, and flat multi-objective baselines as well as exactly computed reference solution sets. Both MIMORL variants recover the reference sets on the pure interpretations and on all evaluated mixtures between them, matching the strongest baseline while remaining steerable across interpretations at inference time, with a factored formulation that is theoretically more efficient than the baselines as the number of interpretations grows. A single trained agent can therefore be deployed and steered to different interpretations, or to positions between them, without committing to one reading of its values in advance, which constitutes a step towards pluralistic AI alignment.
This thesis introduces multi-interpretive multi-objective reinforcement learning (MIMORL), which treats the interpretation of the objectives as an explicit dimension of the learning problem. The underlying multi-interpretive multi-objective Markov decision process (MIMOMDP) carries a matrix-valued reward function in which each row is one interpretation of the objectives. Under the assumption that a single theory or opinion guides the interpretation of all objectives together, the preference space factors into a preference over objectives and a preference over interpretations, so that its size grows linearly rather than exponentially with the number of interpretations. Two algorithms are proposed. The outer-loop method trains one multi-objective sub-solver per interpretation and combines their solutions through an interpretation weight, while the inner-loop method conditions a single network on both preference vectors.
Both methods are evaluated in a modified firefighters environment, in which two defensible interpretations of the values professionalism and proximity induce different optimal behaviour, and are compared against specialist, scalarized, and flat multi-objective baselines as well as exactly computed reference solution sets. Both MIMORL variants recover the reference sets on the pure interpretations and on all evaluated mixtures between them, matching the strongest baseline while remaining steerable across interpretations at inference time, with a factored formulation that is theoretically more efficient than the baselines as the number of interpretations grows. A single trained agent can therefore be deployed and steered to different interpretations, or to positions between them, without committing to one reading of its values in advance, which constitutes a step towards pluralistic AI alignment.
Evaluating the effectiveness of large language models in meeting summarization with transcript segmentation techniques
How well does gpt-3.5-turbo perform on meeting summarization with topic and context-length window segmentation?
Large Language Models (LLM) have brought significant performance increase on many Natural Language Processing tasks. However LLMs have not been tested for meeting summarization. This research paper examines the effectiveness of the gpt-3.5-turbo model on the meeting summarization domain. However due to input length limitations, it cannot be applied directly to this task. Thus the paper investigates two segmentation methods: a simple context-length window approach and topic segmentation using Latent Dirichlet Allocation (LDA). The context-length window approach's performance is close to the Pointer Generator framework. The topic segmentation gives worse results. Overall gpt-3.5-turbo performs worse with both approaches than state-of-the-art models which use a transformer architecture adapted for long documents.
...
Large Language Models (LLM) have brought significant performance increase on many Natural Language Processing tasks. However LLMs have not been tested for meeting summarization. This research paper examines the effectiveness of the gpt-3.5-turbo model on the meeting summarization domain. However due to input length limitations, it cannot be applied directly to this task. Thus the paper investigates two segmentation methods: a simple context-length window approach and topic segmentation using Latent Dirichlet Allocation (LDA). The context-length window approach's performance is close to the Pointer Generator framework. The topic segmentation gives worse results. Overall gpt-3.5-turbo performs worse with both approaches than state-of-the-art models which use a transformer architecture adapted for long documents.