CDDN tackles visual relationship detection with context-dependent diffusion networks.
problem Combustion of combinatorial explosion in relation triplets detection.
method CDDN framework using semantic and visual scene graphs for adaptive information aggregation.
result CDDN achieves state-of-the-art performance on visual relationship detection datasets.
The paper tackles context-dependent choice functions, proposing a model and neural network architectures.
problem Learning choice functions under context-dependent preferences.
method Context-dependent (latent) utility functions, two neural network architectures.
result Demonstrates the effectiveness of the proposed models on synthetic and real-world datasets.
Object ranking is an important problem in the realm of preference learning. On the basis of training data in the form of a set of rankings of objects, which are typically represented as feature vectors, the goal is to learn a ranking function that predicts a linear order of any new set of objects. Current approaches co…
Model captures context-dependent neural correlations using Poisson mixtures.
problem Capturing context-dependent noise correlations in neural populations.
method Conditional finite mixtures of Poisson distributions, cross-validation for dimensionality, EM algorithm.
result Model successfully captures stimulus-dependent correlations in V1 neuron responses.
Global watermark for diffusion language models decouples detection from local contexts.
problem Watermarking in diffusion language models is challenging due to joint sampling of distributions over many unresolved positions.
method Proposes a global vector-valued sketch representation to control watermarking in masked diffusion language models.
result The method decouples detection from local contexts, resulting in an order-agnostic statistic and robustness.
This paper models how features influence event triggers in high-dimensional networks.
problem Estimating context-dependent networks in high-dimensional marked point processes.
method Leveraging compositional time series and regularization methods, the paper considers autoregressive multinomial and logistic-normal models for network estimation.
result The logistic-normal model leads to a convex negative log-likelihood objective and captures dependence across categories.
We extend manifold capacity to nonlinear neural representations with contextual information.
problem Efficient processing of information through neural representations.
method Theoretical framework leveraging latent directions in input space related to contextual information.
result Derivation of an exact formula for context-dependent manifold capacity.
Efficiently selects top-m designs for various contexts using sequential sampling.
problem Optimizing selection of top-m designs across different contexts.
method Formulated as a stochastic dynamic programming problem, developed sequential sampling policy.
result Asymptotically optimal sampling ratios for efficient selection.
In many cases, feature selection is often more complicated than identifying a single subset of input variables that would together explain the output. There may be interactions that depend on contextual information, i.e., variables that reveal to be relevant only in some specific circumstances. In this setting, the con…
Improves TTS accuracy by correcting context-dependent units.
problem Improves text-to-speech accuracy through speaker adaptation.
method Statistical model predicting context-dependent phonetic unit classes and their mean error values.
result Corrected boundaries of units improve TTS accuracy compared to HMM segmentation.
Mahé provides hierarchical explanations for complex interactions in machine learning models.
problem Capturing and explaining complex interactions in machine learning models.
method Model-agnostic hierarchical explanations through local interpretation and context-free generalization.
result Improved local interaction interpretations and successful explanation of context-free interactions.
MQTransformer improves forecast accuracy with context-aware attention.
problem Improving probabilistic demand prediction accuracy.
method Incorporates Transformer architectures for context alignment and feedback-aware attention.
result Significant improvements in forecast accuracy, reducing excess variability.
Improved stock price prediction using attention modules and news sentiment.
problem Predicting stock prices with non-stationary and non-parametric data.
method α_{t}-RIM architecture with attention modules and exponentially smoothed recurrent neural network.
result The α t α_{t} α t -RIM outperforms state-of-the-art models in predicting unseen data. Proposes a new model for context-dependent decision-making.
problem Constant preference parameters in decision models are too rigid.
method Introduces Context-aware Bayesian mixed multinomial logit model using neural networks.
result Models context-dependent intra-respondent heterogeneity effectively.
Algorithm minimizes regret in dueling bandits with contextualized utilities.
problem Minimizing regret in dueling bandits with context-dependent utilities.
method Proposes CoLSTIM algorithm based on perturbed utility estimates.
result Achieves regret of order i l d e O ( d T ) ilde O(\sqrt{dT}) i l d e O ( d T ) . Contextualized ML learns context-dependent effects using deep learning.
problem Learning heterogeneous and context-dependent effects in data.
method Applying deep learning to the meta-relationship between contextual information and context-specific parametric models.
result Unified framework for cluster analysis and cohort modeling.
We investigate a novel cluster-of-bandit algorithm CAB for collaborative recommendation tasks that implements the underlying feedback sharing mechanism by estimating the neighborhood of users in a context-dependent manner. CAB makes sharp departures from the state of the art by incorporating collaborative effects into …
Hybrid ASR systems can model graphemes effectively using chenones, outperforming traditional methods.
problem Traditional hybrid ASR systems struggle with English's poor grapheme-phoneme correspondence.
method Leveraging tied context-dependent graphemes (chenones) to model graphemes directly.
result Chenone-based systems significantly outperform senone baselines by 4.5% to 11.1% on English datasets.
We have recently shown that deep Long Short-Term Memory (LSTM) recurrent neural networks (RNNs) outperform feed forward deep neural networks (DNNs) as acoustic models for speech recognition. More recently, we have shown that the performance of sequence trained context dependent (CD) hidden Markov model (HMM) acoustic m…
Model infers diffusion networks from heterogeneous cascade data.
problem Understanding and predicting diffusion processes in interconnected populations.
method Double mixture directed graph model with layer-specific constraints.
result Convex formulation allows for statistical and computational guarantees.
New techniques save bits in image compression with upsampling.
problem Lack of context dependence in current image compression methods with upsampling.
method Simple, inexpensive techniques exploiting context to predict Laplace distribution parameters.
result Average savings of 0.645 bits per difference, up to 1.489 bits.
In this paper, we analyze energy-harvesting adaptive diffusion networks for a distributed estimation problem. In order to wisely manage the available energy resources, we propose a scheme where a censoring algorithm is jointly applied over the diffusion strategy. An energy-aware variation of a diffusion algorithm is us…
An efficient algorithm for aligning diffusion trees to networks with information asymmetry.
problem Aligning diffusion trees to networks with information asymmetry.
method Tree correlation tests for extracting alignment information.
result Explicit lower bounds on the probability of correct matches for each vertex on the diffusion tree.
Efficiently reconstructs jump-diffusion processes from data using neural networks.
problem Reconstructing jump-diffusion processes from data.
method Temporally decoupled squared Wasserstein distance method using parameterized neural networks.
result Enhanced reconstruction of jump-diffusion processes from data.
Deep learning predicts information diffusion in complex networks.
problem Predicting information spread in heterogeneous networks with local and threshold limitations.
method Meta-path representation learning for global latent representation of heterogeneous networks, followed by deep learning.
result The proposed HDD approach outperforms existing methods in topic diffusion and cascade prediction.
Neural network approximates diffusion bridges for efficiency and robustness.
problem Efficient simulation of conditioned diffusion processes, especially rare events and multimodal distributions.
method Trains a neural network to approximate bridge dynamics, eliminating MCMC and score modeling.
result Efficient sampling of conditioned diffusion bridges at comparable cost to unconditioned process.
SM-netFusion estimates brain network atlas by considering multiple topological measures.
problem Limited BNA estimation methods that overlook topological measures and lack discriminative power.
method Supervised multi-topology network cross-diffusion framework using degree, closeness, and eigenvector centrality measures.
result SM-netFusion produces more centered and representative templates, and improves classification accuracy.
A new model captures diffusion dynamics in networks using hidden states.
problem Capturing temporal relationships and hidden content trajectories in network diffusion.
method A topological recurrent neural model that embeds diffusion history as hidden states.
result Good experimental performances for diffusion modeling and prediction.
A new neural network approach for diffusion on networks.
problem Inference and estimation of diffusion on network structures.
method Neural mean-field dynamics derived from Mori-Zwanzig formalism, approximated by learnable time convolution operators.
result Significantly outperforms existing approaches in accuracy and efficiency.
New neural network learns adaptive behaviors inspired by neuromodulation.
problem Current AI lacks the ability to adapt to changing environments.
method Inspired by cellular neuromodulation, a new deep neural network architecture is designed.
result Neuromodulation-based networks improve adaptation in meta-reinforcement learning tasks.
Improved neural model for social recommendation by integrating social and interest networks.
problem Data sparsity and lack of higher-order relationships in social recommendation.
method DiffNet++ models neural influence diffusion and interest diffusion in a unified framework using a multi-level attention network.
result Extensive experiments on real-world datasets show the effectiveness of DiffNet++.
This paper extends neural network approximation results to denoising diffusion models.
problem Improving the efficiency and accuracy of generative models.
method Leveraging connections to stochastic control and neural network approximation.
result Established neural network approximation results for the Föllmer drift are extended to denoising diffusion models.
New method identifies diffusion sources on networks with statistical confidence.
problem Identifying sources of diffusion on networks without restrictive assumptions.
method Statistical framework and confidence set inference approach based on hypothesis testing.
result Efficiently produces a small subset of nodes covering the source node with any confidence level.
Information diffusion in online social networks is affected by the underlying network topology, but it also has the power to change it. Online users are constantly creating new links when exposed to new information sources, and in turn these links are alternating the way information spreads. However, these two highly i…
Method predicts diffusion reach probabilities using node embeddings.
problem Estimating diffusion reach probabilities with limited cascades and network information.
method Representation learning on node embeddings for cascade prediction.
result Proposed method outperforms using available cascade data.
Improved node classification in signed social networks using diffuse interface methods.
problem Classifying nodes in signed social networks (positive and negative interactions).
method Diffuse interface methods based on Ginzburg-Landau functional and extended graph Laplacian.
result Performance improvement in real signed social networks, outperforming state of the art.
Equivariant diffusion model generates 3D molecules efficiently.
problem Generating high-quality 3D molecules efficiently.
method Equivariant Diffusion Model (EDM) that operates on atom coordinates and types.
result Significantly outperforms previous methods in molecule quality and training efficiency.
Generative diffusion models mimic biological memory networks, encoding associative dynamics in deep neural weights.
problem Understanding long-term memory mechanisms in neuroscience and AI.
method Interpreting generative diffusion models as energy-based models and comparing them to Hopfield networks.
result Generative diffusion models can encode associative dynamics of Hopfield networks in deep neural weights.
Information diffusion and virus propagation are fundamental processes taking place in networks. While it is often possible to directly observe when nodes become infected with a virus or adopt the information, observing individual transmissions (i.e., who infects whom, or who influences whom) is typically very difficult…
Develops methods to analyze feature-outcome associations in subpopulations.
problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.
Improved NPE with conditional diffusions and summary networks.
problem Approximating complex posterior distributions efficiently and accurately.
method Conditional diffusions coupled with high-capacity summary networks.
result Conditional diffusions offer improved stability, accuracy, and faster training times.
Develops DSD for analyzing multiscale biological networks.
problem Analyzing multiscale structure in biological networks.
method Data-driven diffusion process with multitemporal analysis.
result Parameter-free inference of intrinsic data structure.
The paper examines how updates to probabilistic models influence behavior based on evidence.
problem Understanding how updates to probabilistic models influence behavior based on evidence.
method Study of KL-regularized soft updates as Bayesian posterior updates within a single probabilistic model.
result Posterior updates determine relative incentives but not absolute rewards, which are ambiguous up to context-specific baselines.
Paper connects neural network score approximation to reverse diffusion model distribution approximation.
problem Quantifying the relationship between neural network score approximation and the distribution generated by reverse diffusion models.
method Combines Hornik's universal approximation theorem, Girsanov's theorem, and data processing inequality.
result Neural network score approximation guarantees distribution approximation in reverse diffusion models.
Paper infers multiplex network structure from social interactions.
problem Challenges in understanding diffusion in social networks due to hidden structure and multiple interaction patterns.
method Proposes Multiplex Diffusion Model (MDM) using multivariate marked Hawkes process and topic model.
result MDM more effectively uncovers multiplex network structure compared to previous methods.
AdaPID optimizes diffusion-based samplers by dynamically adjusting schedules.
problem Optimizing the intermediate-time dynamics in diffusion-based samplers.
method Develops a time-varying stiffness schedule using Piece-Wise-Constant (PWC) parametrizations and a hierarchical refinement approach.
result QoS-driven PWC schedules consistently improve sampling fidelity and accuracy.
Unified approach for influence maximization using diffusion cascade representations.
problem Influence maximization on networks with diffusion cascades.
method Multi-task neural network learning influencer and susceptible vectors; greedy algorithm for influence maximization.
result IMINFECTOR outperforms other methods in efficiency and seed set quality.
AI learns to learn sequentially without forgetting.
problem Preventing catastrophic forgetting in machine learning models.
method Meta-learning a neuromodulatory activation-gating function to control selective activation in deep neural networks.
result State-of-the-art continual learning performance with 600 classes (9,000 updates).