paper-with-me

Papers

FRAPPE: $\underline{\text{F}}$ast $\underline{\text{Ra}}$nk $\underline{\text{App}}$roximation with $\underline{\text{E}}$xplainable Features for Tensors

2022-06-19 · William Shiao, Evangelos E. Papalexakis

Tensor decompositions have proven to be effective in analyzing the structure of multidimensional data. However, most of these methods require a key parameter: the number of desired components. In the case of the CANDECOMP/PARAFAC decomposition (CPD), the ideal value for the number of components is known as the canonical rank and greatly affects the quality of the decomposition results. Existing methods use heuristics or Bayesian methods to estimate this value by repeatedly calculating the CPD, making them extremely computationally expensive. In this work, we propose FRAPPE, the first method to estimate the canonical rank of a tensor without having to compute the CPD. This method is the result of two key ideas. First, it is much cheaper to generate synthetic data with known rank compared to computing the CPD. Second, we can greatly improve the generalization ability and speed of our model by generating synthetic data that matches a given input tensor in terms of size and sparsity. We can then train a specialized single-use regression model on a synthetic set of tensors engineered to match a given input tensor and use that to estimate the canonical rank of the tensor - all without computing the expensive CPD. FRAPPE is over 24 times faster than the best-performing baseline and exhibits a 10% improvement in MAPE on a synthetic dataset. It also performs as well as or better than the baselines on real-world datasets.

📄 PDF Abstract BibTeX arXiv:2206.09316

Code (1)

willshiao/frappe 공식 구현

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

A Deep Generative XAI Framework for Natural Language Inference Explanations Generation

2021-11-16 · ACL ARR November 2021 11 · Anonymous

Explainable artificial intelligence with natural language explanations (Natural-XAI) aims to produce human-readable explanations as evidence for AI decision-making. This evidence can enhance human trust and understanding…

Decision MakingExplainable artificial intelligenceExplainable Artificial Intelligence (XAI)Explanation Generation+1

sPEGG: high throughput eco-evolutionary simulations on commodity graphics processors

2016-03-30

Integrating population genetics into community ecology theory is a major goal in ecology and evolution, but analyzing the resulting models is computationally daunting. Here we describe sPEGG ($\underline{\textrm{s}}\text…

Vocal Bursts Intensity Prediction

Finite Horizon Multi-Agent Reinforcement Learning in Solving Optimal Control of State-Dependent Switched Systems

2023-12-08 · Mi Zhou, Jiazhi Li, Masood Mortazavi, Ning Yan 외

In this article, a \underline{S}tate-dependent \underline{M}ulti-\underline{A}gent \underline{D}eep \underline{D}eterministic \underline{P}olicy \underline{G}radient (\textbf{SMADDPG}) method is proposed in order to lear…

Multi-agent Reinforcement Learning

A stochastic alternating minimizing method for sparse phase retrieval

2019-06-14 · Jian-Feng Cai, Yuling Jiao, Xiliang Lu, Juntao You

Sparse phase retrieval plays an important role in many fields of applied science and thus attracts lots of attention. In this paper, we propose a \underline{sto}chastic alte\underline{r}nating \underline{m}inimizing meth…

Retrieval

Empowering VLMs for Few-Shot Multimodal Time Series Classification via Tailored Agentic Reasoning

2026-05-10 · Lin Li, Jiawei Huang, Qihao Quan, Dan Li 외 arxiv

In this paper, we propose the first VL$\underline{\textbf{M}}$ $\underline{\textbf{a}}$gentic $\underline{\textbf{r}}$easoning framework for few-$\underline{\textbf{s}}$hot multimodal $\underline{\textbf{T}}$ime $\underl…

Time Series Classification