Tata Consultancy Services' Capital Markets Focussed Workflow, Innovative Process Enhancers, and Solutions Backed by the Latest Technologies, Cited as Key Strengths Tata Consultancy Services (TCS), a leading global IT services, consulting and business solutions organization, has been recognized as a Leader in the Everest Group PEAK Matrix for Capital Markets Operations. In an assessment of 24 global service providers offering capital markets operations services, TCS was placed highest for Vision and Capability, as well as Market Impact. Additionally, it was named a Star Performer for having top quartile year-on-year improvement in its scores. TCS' strong position in the overall capital markets segment is attributed to consistent growth in its portfolio with multiple new wins. According to the report, the company has continuously worked on creating solutions backed with the latest technology to help its customers solve operational problems more efficiently.

On Tinder, an opening line can go south pretty quickly. And while there are plenty of Instagram accounts dedicated to exposing these "Tinder nightmares," when the company looked at its numbers, it found that users reported only a fraction of behavior that violated its community standards. Now, Tinder is turning to artificial intelligence to help people dealing with grossness in the DMs. The popular online dating app will use machine learning to automatically screen for potentially offensive messages. If a message gets flagged in the system, Tinder will ask its recipient: "Does this bother you?"

Facing a fridge full of ingredients but still don't know what to cook? Tired of following the same recipes and eager to try something new and creative? Thanks to AI technologies such as image recognition and machine learning, people can now save time, food and money in the kitchen while discovering creative and tasty recipes and even generating their own new and personalized flavours. Facebook has developed an image-to-recipe generation system which enables users to reverse engineer a recipe by simply inputting an image of the dish they want to prepare. First, ingredients and ingredient co-occurrence are generated by exploiting visual features extracted from the food image.

Higher-order tensors arise frequently in applications such as neuroimaging, recommendation system, social network analysis, and psychological studies. We consider the problem of low-rank tensor estimation from possibly incomplete, ordinal-valued observations. Two related problems are studied, one on tensor denoising and another on tensor completion. We propose a multi-linear cumulative link model, develop a rank-constrained M-estimator, and obtain theoretical accuracy guarantees. Our mean squared error bound enjoys a faster convergence rate than previous results, and we show that the proposed estimator is minimax optimal under the class of low-rank models. Furthermore, the procedure developed serves as an efficient completion method which guarantees consistent recovery of an order-$K$ $(d,\ldots,d)$-dimensional low-rank tensor using only $\tilde{\mathcal{O}}(Kd)$ noisy, quantized observations. We demonstrate the outperformance of our approach over previous methods on the tasks of clustering and collaborative filtering.

Artificial intelligence (AI), otherwise known as machine learning, is slowly reshaping retail from optimizing back-end supply chain operations to in-store execution. It is also impacting marketing, customer service engagement and anti-fraud activities, according to a report from New York-based information technology industry analyst firm 451 Research. While AI is far from the mainstream, researchers said plenty of retailers are experimenting with how machine learning can be applied in many areas of retail. The report states retailers won't be the only ones needing to adapt to the disruption of machine learning as customers will also face changes in how they view and experience shopping. For AI to work to its full potential, researchers said customers will need to be comfortable with increased data sharing if they want to benefit from personalized shopping experiences via machine learning.

Social tags are user-generated keywords associated with some resource on the Web. In the case of music, social tags have become an important component of Web2.0" recommender systems, allowing users to generate playlists based on use-dependent terms such as "chill" or "jogging" that have been applied to particular songs. In this paper, we propose a method for predicting these social tags directly from MP3 files. Using a set of boosted classifiers, we map audio features onto social tags collected from the Web. The resulting automatic tags (or "autotags") furnish information about music that is otherwise untagged or poorly tagged, allowing for insertion of previously unheard music into a social recommender. This avoids the ''cold-start problem'' common in such systems. Autotags can also be used to smooth the tag space from which similarities and recommendations are made by providing a set of comparable baseline tags for all tracks in a recommender system."

We show that matrix completion with trace-norm regularization can be significantly hurt when entries of the matrix are sampled non-uniformly, but that a properly weighted version of the trace-norm regularizer works well with non-uniform sampling. We show that the weighted trace-norm regularization indeed yields significant gains on the highly non-uniformly sampled Netflix dataset. Papers published at the Neural Information Processing Systems Conference.

User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is often difficult to collect it is important to develop effective models that take advantage of the more widely available implicit feedback. We introduce a probabilistic approach to collaborative filtering with implicit feedback based on modelling the user's item selection process. In the interests of scalability, we restrict our attention to tree-structured distributions over items and develop a principled and efficient algorithm for learning item trees from data. We also identify a problem with a widely used protocol for evaluating implicit feedback models and propose a way of addressing it using a small quantity of explicit feedback data.

Factorization methods for recommender systems tend to represent users as a single latent vector. However, user behavior and interests may change in the context of the recommendations that are presented to the user. For example, in the case of movie recommendations, it is usually true that earlier user data is less informative than more recent data. However, it is possible that a certain early movie may become suddenly more relevant in the presence of a popular sequel movie. This is just a single example of a variety of possible dynamically altering user interests in the presence of a potential new recommendation. In this work, we present Attentive Item2vec (AI2V) - a novel attentive version of Item2vec (I2V). AI2V employs a context-target attention mechanism in order to learn and capture different characteristics of user historical behavior (context) with respect to a potential recommended item (target). The attentive context-target mechanism enables a final neural attentive user representation. We demonstrate the effectiveness of AI2V on several datasets, where it is shown to outperform other baselines.

Amazon Dating doesn't really exist -- yet. But a mock-up of what Amazon Dating might look like fooled some this week, and got others talking.