Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

10203040 · Jun 202019922001200920172026
48 results for preference disaggregation

Review and compare sorting model selection methods for preference disaggregation.

problem Selecting a representative sorting model from multiple compatible models.
method Reviewed and proposed new procedures for selecting sorting models, including robust assignment rule.
result Identified most efficient procedures in terms of classification accuracy and robustness.

The paper evaluates various forecasting methods for inflation, finding ML models superior.

problem Forecasting inflation using disaggregated data and machine learning.
method Examines traditional and machine learning models, including random forest, for disaggregated and aggregated inflation forecasts.
result Aggregating disaggregated forecasts performs similarly to survey-based expectations and aggregate models.

New framework for interpreting disaggregated fairness evaluations using causal models.

problem Misinterpretation of disaggregated fairness evaluations due to data representativeness and selection bias.
method Causal graphical models to characterize fairness properties and metric stability under different data generating processes.
result Disaggregated evaluations are unreliable without explicit assumptions regarding bias mechanisms.

Paper proposes a novel optimization method for disaggregating smart meter data.

problem Energy disaggregation, inferring appliance-specific energy consumption from aggregate meter data.
method Two-stage optimization approach: first phase uses mixed integer programming, second phase binary quadratic optimization with penalty terms and appliance constraints.
result Proposed method successfully reconstructs appliance signatures, overcoming previous optimization-based methods' limitations.

Non-intrusive load monitoring or energy disaggregation involves estimating the power consumption of individual appliances from measurements of the total power consumption of a home. Deep neural networks have been shown to be effective for energy disaggregation. In this work, we present a deep neural network architectur…

2018-12-10abs ↗pdf ↗

Energy is a limited resource which has to be managed wisely, taking into account both supply-demand matching and capacity constraints in the distribution grid. One aspect of the smart energy management at the building level is given by the problem of real-time detection of flexible demand available. In this paper we pr…

2016-05-06abs ↗pdf ↗

This paper addresses the energy disaggregation problem, i.e. decomposing the electricity signal of a whole home to its operating devices. First, we cast the problem as a dictionary learning (DL) problem where the key electricity patterns representing consumption behaviors are extracted for each device and stored in a d…

2018-09-10abs ↗pdf ↗

tempdisagg transforms low-frequency data into high-frequency estimates.

problem Transforming low-frequency data into high-frequency estimates.
method Uses econometric techniques including Chow-Lin, Denton, Litterman, Fernandez, and uniform interpolation.
result Transforms low-frequency aggregates into consistent, high-frequency estimates.

New algorithm extracts device profiles for short-term power predictions in commercial buildings.

problem Short-term power prediction in commercial buildings with high accuracy.
method Unsupervised extraction of device profiles from aggregate power measurements, disaggregation using particle swarm optimization, and state changes forecast by artificial neural networks.
result Developed approach outperforms existing methods with high accuracy.

This paper presents a novel data-driven technique based on the spatiotemporal pattern network (STPN) for energy/power prediction for complex dynamical systems. Built on symbolic dynamic filtering, the STPN framework is used to capture not only the individual system characteristics but also the pair-wise causal dependen…

2017-02-03abs ↗pdf ↗

A new deep learning method for energy disaggregation.

problem Energy disaggregation or non-intrusive load monitoring (NILM) to identify individual appliance power usage.
method Sequence to Point Learning based on Bidirectional Dilated Residual Network (BRDN).
result Our method outperforms state-of-the-art approaches in all appliances on REDD and UK-DALE datasets.

A new method improves AI fairness assessment by estimating performance across intersectional subgroups.

problem Limited evaluation of AI systems across intersectional subgroups due to small sample sizes.
method Structured regression approach to disaggregated evaluation.
result Our method yields more accurate performance estimates, especially for small subgroups.

CTGAN synthesizes population data for travel behavior simulation.

problem Synthesizing population data for agent-based transportation modeling.
method Composite Travel Generative Adversarial Network (CTGAN).
result Consistent and accurate generation of synthetic populations with tabular and sequential mobility data.

The S&P500 daily values and log-returns fail to conform to Benford's laws, revealing underlying trends.

problem Testing financial data for conformity to Benford's laws.
method Analyzed S&P500 daily closing values and log-returns over 16,265 days, disaggregating at five levels.
result S&P500 daily values show a huge lack of conformity to Benford's laws, with missing first and first two digits.

Novel approach integrates Multivariate Square-root Lasso into Synthetic Control for high-dimensional data.

problem Challenges in practical implementation and computational efficiency of Synthetic Control method for high-dimensional disaggregated data.
method Integrates Multivariate Square-root Lasso into Synthetic Control framework.
result Demonstrates superior computational efficiency without compromising estimation accuracy.

Multidimensional data have become ubiquitous and are frequently encountered in situations where the information is aggregated over multiple data atoms. The aggregation can be over time or other features, such as geographical location. We often have access to multiple aggregated views of the same data, each aggregated i…

2019-10-26abs ↗pdf ↗

State aggregation is a popular model reduction method rooted in optimal control. It reduces the complexity of engineering systems by mapping the system's states into a small number of meta-states. The choice of aggregation map often depends on the data analysts' knowledge and is largely ad hoc. In this paper, we propos…

2018-11-06abs ↗pdf ↗

Develops a method to disaggregate aerosol optical depth into vertical extinction profiles.

problem Uncertainty in measuring aerosol vertical distributions due to limited observations.
method Bayesian nonparametric Gaussian process modeling using meteorological predictors.
result Model reconstructs realistic extinction profiles with well-calibrated uncertainty, outperforming idealized baselines.

A convolutional sequence to sequence non-intrusive load monitoring model is proposed in this paper. Gated linear unit convolutional layers are used to extract information from the sequences of aggregate electricity consumption. Residual blocks are also introduced to refine the output of the neural network. The partiall…

2018-06-06abs ↗pdf ↗

We present an approach to estimate the severity of traffic related accidents in aggregated (area-level) and disaggregated (point level) data. Exploring spatial features, we measure complexity of road networks using several area level variables. Also using temporal and other situational features from open data for New Y…

2019-06-25abs ↗pdf ↗

New method adapts to user preferences dynamically, improving recommendation models.

problem Current recommendation models lack dynamic adaptation to changing user preferences.
method Preference Discerning with LLM-Enhanced Generative Retrieval
result Mender achieves state-of-the-art performance in adapting to evolving user preferences.

Many real-world engineering problems rely on human preferences to guide their design and optimization. We present PrefOpt, an open source package to simplify sequential optimization tasks that incorporate human preference feedback. Our approach extends an existing latent variable model for binary preferences to allow f…

2018-01-09abs ↗pdf ↗

Bayesian optimization learns DM preferences for multi-outcome experiments.

problem Optimizing expensive experiments with unknown utility functions and multiple outcomes.
method Alternates preference learning and Bayesian optimization, using pairwise comparisons.
result Preference exploration strategies improve Bayesian optimization performance.

New study shows personalized content recommendations can lead to polarization of user preferences.

problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.

Bayesian optimization agent learns user preferences from pairwise comparisons.

problem Learning user preferences from unknown and infinite choices.
method Sequential Bayesian optimization with pairwise comparisons.
result Optimal agent strategy minimizes remaining system uncertainty.

New RLHF framework handles general preference oracles without reward functions.

problem Handling general preference oracles without assuming a reward function.
method Developed a minimax game between two LLMs for RLHF under a general preference oracle, focusing on KL-regularized preference.
result Proposed algorithms for efficient offline and online RLHF learning.

In preference-based reinforcement learning (RL), an agent interacts with the environment while receiving preferences instead of absolute feedback. While there is increasing research activity in preference-based RL, the design of formal frameworks that admit tractable theoretical analysis remains an open challenge. Buil…

2019-08-04abs ↗pdf ↗

Study on identifying most preferred policy in bandits with vector-valued rewards.

problem Identifying the most preferred policy in bandits with vector-valued rewards.
method Derive a novel lower bound on sample complexity, design the Preference-based Track and Stop (PreTS) algorithm, and derive a new concentration inequality.
result The sample complexity of PreTS is asymptotically tight.

Stable and consistent model alignment for language models without assuming human preference models.

problem Lack of statistical consistency in existing alignment methods.
method Relative density ratio optimization between preferred and mixture of preferred and non-preferred data distributions.
result Our approach achieves statistical consistency and stability, providing tighter convergence guarantees.

Dropping a tiny fraction of preferences can significantly alter the rankings of top LLMs.

problem Robustness of LLM ranking systems to small changes in preference data.
method A computational method based on the Bradley-Terry model to evaluate robustness.
result Top LLM rankings can be highly sensitive to the removal of a small fraction of preferences.

Paper explores limits and possibilities of aligning LLMs with human preferences.

problem Aligning LLMs with diverse human preferences to ensure fairness and informed outcomes.
method Analysis of probabilistic representation of human preferences and preservation of diverse preferences.
result LLMs can't fully align with human preferences using reward-based approaches due to Condorcet cycles, but mixed strategies are statistically possible.

Paper improves parameter estimation of continuous distributions using preference feedback.

problem Improving parameter estimation of continuous distributions.
method Preference-based M-estimators and deterministic preferences.
result Preference-based estimators achieve an estimation error scaling of O(1/n), significantly faster than sample-only methods.