Paper introduces a method for generating interlocutor-aware facial gestures in dyadic settings.
problem Generating appropriate non-verbal behavior for conversational agents in dyadic settings.
method Probabilistic method using multi-modal cues from the interlocutor to synthesize facial gestures.
result The model successfully leverages multi-modal input from the interlocutor to generate more appropriate behavior.
Self-attentive network improves emotion recognition in conversations.
problem Emotion recognition in dyadic conversations using deep learning.
method Introduces a novel self-attention mechanism for capturing temporal dynamics without a decoder.
result Outperforms state-of-the-art alternatives on the IEMOCAP benchmark.
Study finds neural dialog models struggle with conversational tasks.
problem Insufficient understanding of dialog by neural models.
method Analysis of internal representations and evaluation of model performance.
result Neural dialog models lack key conversational skills like answering questions and inferring contradiction.
Interpersonal relations are fickle, with close friendships often dissolving into enmity. In this work, we explore linguistic cues that presage such transitions by studying dyadic interactions in an online strategy game where players form alliances and break those alliances through betrayal. We characterize friendships …
Develops a personalized reinforcement learning algorithm for dyadic health interventions.
problem Personalizing health interventions for dyadic relationships in mobile health.
method Dyadic Reinforcement Learning (dyadic RL), a Bayesian and hierarchical online algorithm.
result Established a regret bound and demonstrated empirical performance through simulations and real data.
Method estimates treatment effects in dyadic data with unknown confounders.
problem Estimating treatment effects in dyadic data with unobserved confounders.
method Neighborhood kernel smoothing method for graphon estimation.
result Derives rate of convergence for estimator and demonstrates test size control.
Estimates piecewise polynomials and bounded variation functions using optimal decision trees.
problem Estimating piecewise smooth functions in general dimensions.
method Dyadic CART and Optimal Regression Tree (ORT) estimators for piecewise polynomials and bounded variation functions.
result Oracle inequalities and risk bounds for ORT estimators, demonstrating adaptivity and optimality.
Paper studies long-run risk optimization with dyadic impulses for unbounded processes.
problem Long-run risk optimization problem with unbounded and non-uniformly ergodic processes.
method Adapting weight norm approach, combining geometric drift and local minorization property.
result Existence of solution to Bellman equation for risk-averse parameters.
The paper develops a cross-validation method for improving signal denoising techniques.
problem Improving signal denoising methods for nonparametric regression.
method Develops a general cross-validation framework for signal denoising and applies it to Trend Filtering and Dyadic CART.
result Cross validated versions of Trend Filtering and Dyadic CART achieve nearly optimal convergence rates.
Improves algorithm selection for thousands of candidates using dyadic features.
problem Selecting the best algorithm from a large set of candidates for specific problems.
method Proposes extreme algorithm selection (XAS) with dyadic feature representation.
result Improves significantly over current state of the art in various metrics.
Develop conformal prediction for dyadic regression under complex missingness.
problem Conformal prediction for dyadic regression under complex missingness mechanisms.
method Developing general technical tools and conformal prediction procedures for dyadic regression under complex missingness.
result Establishing asymptotic validity of weighted conformal prediction under a nonparametric graphon model for missingness mechanism.
Variational autoencoder is a powerful deep generative model with variational inference. The practice of modeling latent variables in the VAE's original formulation as normal distributions with a diagonal covariance matrix limits the flexibility to match the true posterior distribution. We propose a new transformation, …
New framework tackles fairness in link prediction beyond demographic parity.
problem Systemic biases in link prediction can exacerbate societal inequalities.
method Formalizes limitations of existing fairness evaluations and proposes a new framework.
result Proposes a lightweight post-processing method combined with decoupled link predictors.
Dyadic Data Prediction (DDP) is an important problem in many research areas. This paper develops a novel fully Bayesian nonparametric framework which integrates two popular and complementary approaches, discrete mixed membership modeling and continuous latent factor modeling into a unified Heterogeneous Matrix Factoriz…
Efficient algorithm computes knot invariants quickly.
problem Computing finite type invariants efficiently for knots.
method Create look-up tables for subdiagrams indexed by dyadic intervals, then compute invariants in ildeO(n⌈2kceil) time. result Finite type invariants can be computed on an n-crossing knot in ildeO(n⌈2kceil) time, significantly faster than previous methods. Paper recovers lattice signal partitions efficiently.
problem Estimating lattice partition from noisy data.
method Uses dyadic CART for computationally-efficient partition recovery.
result Consistently estimates partition with optimal error rate.
Study predicts internet-based treatment effects for GPPPD based on dyadic coping.
problem Identifying which patients will benefit most from internet-based GPPPD treatment.
method Developed a multivariable decision tree model using recursive partitioning.
result Predicts large effects for high dyadic coping patients, small effects for low dyadic coping patients.
A novel hypergraph partitioning method using tensor eigenvalue decomposition captures super-dyadic interactions.
problem Capturing super-dyadic interactions in k-uniform hypergraphs.
method Tensor-based representation and tensor eigenvalue decomposition for capturing interactions.
result Improved min-cut solution on 2-uniform hypergraphs (graphs) compared to standard spectral partitioning.
The paper examines logistic regression in sparse network settings, improving inference under varying degrees of dyadic dependence.
problem Improving inference in logistic regression with sparse network data.
method Sparse network asymptotics, martingale central limit theorem, variance decomposition.
result Sparse network asymptotics lead to better variance estimators for logistic regression.
We present an approach to deep estimation of discrete conditional probability distributions. Such models have several applications, including generative modeling of audio, image, and video data. Our approach combines two main techniques: dyadic partitioning and graph-based smoothing of the discrete space. By recursivel…
New method reduces linear regret in high-dimensional bandit problems.
problem Heavy spectral tails in streaming matrices lead to linear regret in sketch-based linear bandits.
method Dyadic Block Sketching, a multi-scale matrix sketching approach.
result Achieves sublinear regret bounds without prior knowledge of streaming matrix properties.
New method distinguishes predictive distribution estimators in high-dimensional inputs.
problem Difficulty in evaluating predictive distributions for high-dimensional inputs.
method Introduces dyadic sampling to focus on predictive distributions associated with pairs of inputs.
result Demonstrates efficient distinction of predictive distribution estimators in high-dimensional examples.
We build polyhedral complexes in Rn that coincide with dyadic grids with different orientations, while keeping uniform lower bounds (depending only on n) on the flatness of the added polyhedrons including their subfaces in all dimensions. After the definitions and first properties of compact Euclidean polyhedrons and c…
While a user's preference is directly reflected in the interactive choice process between her and the recommender, this wealth of information was not fully exploited for learning recommender models. In particular, existing collaborative filtering (CF) approaches take into account only the binary events of user actions …
In self-organizing networks, topology and dynamics coevolve in a continuous feedback, without exogenous driving. The World Trade Network (WTN) is one of the few empirically well documented examples of self-organizing networks: its topology strongly depends on the GDP of world countries, which in turn depends on the str…
We present a Bayesian tensor factorization model for inferring latent group structures from dynamic pairwise interaction patterns. For decades, political scientists have collected and analyzed records of the form "country i took action a toward country j at time t"---known as dyadic events---in order to form an…
New method for efficient ERG fitting on large graphs.
problem Fitting non-trivial ERGs on large graphs.
method Fast matrix block-approximation techniques for dyadic independence.
result Models can generate networks with similar properties to observed networks.
Global existence and decay for quasilinear wave equations on various spacetimes, including Kerr black holes.
problem Global existence and decay for quasilinear wave equations on asymptotically flat spacetimes.
method Dyadically localised nature and direct use of a blackbox linear inhomogeneous energy estimate on exactly stationary metrics.
result Global existence and decay for small-data solutions to quasilinear wave equations on a wide variety of spacetime backgrounds, including Kerr black holes.
Proves subelliptic estimates for geometric Kramers-Fokker-Planck operators on closed manifolds.
problem Proving subelliptic estimates for a specific class of operators on closed manifolds.
method Significantly different method from previous works, using dyadic partition and local analysis in position variable.
result Maximal subelliptic estimates with control of constants in high and low friction regimes.
We consider the problem of group testing with sum observations and noiseless answers, in which we aim to locate multiple objects by querying the number of objects in each of a sequence of chosen sets. We study a probabilistic setting with entropy loss, in which we assume a joint Bayesian prior density on the locations …
An elliptic theory is constructed for operators acting in subspaces defined via odd pseudodifferential projections. Subspaces of this type arise as Calderon subspaces for first order elliptic differential operators on manifolds with boundary, or as spectral subspaces for self-adjoint elliptic differential operators of …
The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are shown to appear as different features in its Weyl coefficients. The Weyl transform …
Paper improves conversion prediction models for online advertising.
problem Predicting different types of conversions in online advertising.
method Multi-Task Learning with MT-FwFM.
result Improved AUC by 0.74% and 0.84% on two conversion types, and overall AUC by 0.50%.
Study examines cash conversion cycle in manufacturing firms, finding negative relationships with profitability and size.
problem Understanding cash conversion cycle in manufacturing firms and its impact on profitability and size.
method Empirical study of 30 manufacturing firms in Dhaka Stock Exchanges, categorizing them into six industries, analyzing industry averages and relationships with size and profitability.
result Negative relationship between cash conversion cycle and profitability, especially ROE; negative relationship with firm size in terms of net sales.
Framework converts singer identity and vocal technique from non-parallel corpora.
problem Converts singer identity and vocal technique from non-parallel corpora.
method Uses variational autoencoders with separate encoders for singer identity and vocal technique.
result Successfully disentangles and converts singer identity and vocal technique.
FasterVoiceGrad speeds up VC by 6-7x with novel distillation.
problem Slow iterative sampling in diffusion-based VC models.
method Adversarial diffusion conversion distillation (ADCD) to create a faster one-step model.
result 6.6-6.9 and 1.8x faster on GPU and CPU, respectively.
Conversational UCB accelerates bandit learning with user feedback.
problem Slow learning speed in traditional contextual bandit algorithms.
method Generalized contextual bandit to conversational contextual bandit, leveraging both behavioral and conversational feedbacks.
result ConUCB achieves a smaller regret upper bound, indicating faster learning speed.
Automated system extracts medication regimens from medical conversations.
problem Extract relevant medication information from medical conversations.
method QA task approach, combined QA and Information Extraction, data augmentation, public embeddings, pretraining.
result Improved accuracy in extracting dosage and frequency from 54.28 and 37.13 to 89.57 and 45.94.
New method selects diffusion scales for graph wavelets.
problem Choosing optimal diffusion scales for graph wavelets.
method Proposes an unsupervised method using information theory.
result Method selects diffusion scales for graph wavelets.
FedConPE improves conversational recommender systems efficiency and privacy.
problem Efficiently eliciting user preferences in interactive systems with heterogeneous clients.
method Phase elimination-based federated conversational bandit algorithm with adaptive key term construction.
result Minimizes uncertainty across all dimensions in feature space and offers improved efficiency and privacy.
Solution for voice conversion with limited data using hierarchical seq2seq and attention models.
problem Voice conversion between speakers with limited parallel audio pairs.
method Hierarchical sequence to sequence model with attention-based decoder, trained on single speaker dataset.
result Improved voice conversion quality using mel spectrograms and wavenet vocoder.
Study proposes a time-aware model to predict user conversion intent.
problem Weak predictive signals from users not suitable for conversion prediction.
method Time-aware approach to model user activities and capture conversion intent signals.
result Approach outperforms other models on real-world datasets.
Improved voice conversion with semi-supervised learning.
problem Voice conversion with limited parallel data.
method Amortized variational inference with parallel and non-parallel utterances.
result Semi-supervised training improves voice conversion performance.
The goal of online display advertising is to entice users to "convert" (i.e., take a pre-defined action such as making a purchase) after clicking on the ad. An important measure of the value of an ad is the probability of conversion. The focus of this paper is the development of a computationally efficient, accurate, a…
CycleGAN-VC3 improves CycleGAN-VCs for mel-spectrogram conversion.
problem Ambiguity in CycleGAN-VC/VC2 effectiveness for mel-spectrogram conversion.
method Proposes CycleGAN-VC3 with time-frequency adaptive normalization (TFAN).
result CycleGAN-VC3 outperforms or matches CycleGAN-VC2 for mel-spectrogram conversion.
A new algorithm for conversational recommendation systems using dueling bandits in GLMs.
problem Limited user feedback in existing conversational bandit methods.
method Integrates dueling bandits with relative feedback in generalized linear models.
result Theoretical and empirical validation of ConDuel's efficacy.
The paper extracts structured data from physician-patient conversations, reducing clerical burden.
problem Mining insights from physician-patient conversations for electronic health record documentation.
method Created a dataset of transcripts and summaries, extracted noteworthy utterances, and improved model performance.
result Extracting noteworthy utterances significantly boosts model performance for recognizing diagnoses and RoS abnormalities.
Schedule-free SGD is optimal for nonconvex optimization problems.
problem Nonconvex optimization in neural networks.
method Developed a general framework for online-to-nonconvex conversion, which converts schedule-free SGD into an effective nonconvex optimization algorithm.
result Schedule-free SGD achieves optimal iteration complexity for nonsmooth, nonconvex optimization problems.