Search Results for author: Eric C. Chi

Found 12 papers, 2 papers with code

Multi-way Graph Signal Processing on Tensors: Integrative analysis of irregular geometries

no code implementations30 Jun 2020 Jay S. Stanley III, Eric C. Chi, Gal Mishne

Graph signal processing (GSP) is an important methodology for studying data residing on irregular structures.

Baseline Drift Estimation for Air Quality Data Using Quantile Trend Filtering

1 code implementation24 Apr 2019 Halley L. Brantley, Joseph Guinness, Eric C. Chi

Through simulation studies and our motivating application to low cost air quality sensor data, we demonstrate that our model provides better quantile trend estimates than existing methods and improves signal classification of low-cost air quality sensor output.

Methodology Applications Computation

Co-manifold learning with missing data

no code implementations16 Oct 2018 Gal Mishne, Eric C. Chi, Ronald R. Coifman

We propose utilizing this coupled structure to perform co-manifold learning: uncovering the underlying geometry of both the rows and the columns of a given matrix, where we focus on a missing data setting.

Data Visualization Representation Learning

Recovering Trees with Convex Clustering

no code implementations28 Jun 2018 Eric C. Chi, Stefan Steinerberger

Convex clustering refers, for given $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^p$, to the minimization of \begin{eqnarray*} u(\gamma) & = & \underset{u_1, \dots, u_n }{\arg\min}\;\sum_{i=1}^{n}{\lVert x_i - u_i \rVert^2} + \gamma \sum_{i, j=1}^{n}{w_{ij} \lVert u_i - u_j\rVert},\\ \end{eqnarray*} where $w_{ij} \geq 0$ is an affinity that quantifies the similarity between $x_i$ and $x_j$.

Provable Convex Co-clustering of Tensors

no code implementations17 Mar 2018 Eric C. Chi, Brian R. Gaines, Will Wei Sun, Hua Zhou, Jian Yang

Our convex co-clustering (CoCo) estimator enjoys stability guarantees and its computational and storage costs are polynomial in the size of the data.

Generalized Linear Model Regression under Distance-to-set Penalties

no code implementations NeurIPS 2017 Jason Xu, Eric C. Chi, Kenneth Lange

Estimation in generalized linear models (GLM) is complicated by the presence of constraints.

An MM Algorithm for Split Feasibility Problems

no code implementations16 Dec 2016 Jason Xu, Eric C. Chi, Meng Yang, Kenneth Lange

Furthermore, we show that the Euclidean norm appearing in the proximity function of the non-linear split feasibility problem can be replaced by arbitrary Bregman divergences.

Shape Constrained Tensor Decompositions using Sparse Representations in Over-Complete Libraries

1 code implementation16 Aug 2016 Bethany Lusch, Eric C. Chi, J. Nathan Kutz

We consider $N$-way data arrays and low-rank tensor factorizations where the time mode is coded as a sparse linear combination of temporal elements from an over-complete library.

Tensor Decomposition

Convex Biclustering

no code implementations5 Aug 2014 Eric C. Chi, Genevera I. Allen, Richard G. Baraniuk

In the biclustering problem, we seek to simultaneously group observations and features.

Collaborative Filtering

Splitting Methods for Convex Clustering

no code implementations1 Apr 2013 Eric C. Chi, Kenneth Lange

In contrast to previously considered algorithms, our ADMM and AMA formulations provide simple and unified frameworks for solving the convex clustering problem under the previously studied norms and open the door to potentially novel norms.

Distance Majorization and Its Applications

no code implementations16 Nov 2012 Eric C. Chi, Hua Zhou, Kenneth Lange

The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics.

On Tensors, Sparsity, and Nonnegative Factorizations

no code implementations11 Dec 2011 Eric C. Chi, Tamara G. Kolda

We present a new algorithm for Poisson tensor factorization called CANDECOMP-PARAFAC Alternating Poisson Regression (CP-APR) that is based on a majorization-minimization approach.

Numerical Analysis

Cannot find the paper you are looking for? You can Submit a new open access paper.