1 code implementation • 31 Aug 2022 • Ramin Raziperchikolaei, Young-joo Chung
In one-class recommendation systems, the goal is to learn a model from a small set of interacted users and items and then identify the positively-related user-item pairs among a large number of pairs with unknown interactions.
no code implementations • 14 Mar 2022 • Ramin Raziperchikolaei, Young-joo Chung
Then, we propose to learn the value of the non-zero elements of the inputs jointly with the neural network parameters.
1 code implementation • 6 Dec 2020 • Harish S. Bhat, Majerle Reeves, Ramin Raziperchikolaei
We also study the combination of either our neural shape function method or existing differential equation learning methods with alternating minimization and multiple trajectories.
1 code implementation • 12 Oct 2020 • Ramin Raziperchikolaei, Tianyu Li, Young-joo Chung
We also apply the NRP framework to a direct neural network structure which predicts the ratings without reconstructing the user and item information.
no code implementations • 16 Oct 2018 • Ramin Raziperchikolaei, Harish S. Bhat
We propose and analyze a block coordinate descent proximal algorithm (BCD-prox) for simultaneous filtering and parameter estimation of ODE models.
no code implementations • NeurIPS 2016 • Miguel Á. Carreira-Perpiñán, Ramin Raziperchikolaei
They ensure that the hash functions differ from each other through constraints or penalty terms that encourage codes to be orthogonal or dissimilar across bits, but this couples the binary variables and complicates the already difficult optimization.
no code implementations • NeurIPS 2016 • Ramin Raziperchikolaei, Miguel Á. Carreira-Perpiñán
Recent work has tried to optimize the objective directly over the binary codes and achieved better results, but the hash function was still learned a posteriori, which remains suboptimal.
1 code implementation • CVPR 2015 • Miguel Á. Carreira-Perpiñán, Ramin Raziperchikolaei
An attractive approach for fast search in image databases is binary hashing, where each high-dimensional, real-valued image is mapped onto a low-dimensional, binary vector and the search is done in this binary space.