credit assignment meaning

• Get IGI Global News
• Language: English

• All Products
• Book Chapters
• Journal Articles
• Video Lessons
• Teaching Cases

Shortly You Will Be Redirected to Our Partner eContent Pro's Website

eContent Pro powers all IGI Global Author Services. From this website, you will be able to receive your 35% discount (automatically applied at checkout), receive a free quote, place an order, and retrieve your final documents .

What is Credit-Assignment

Related Books View All Books

Related Journals View All Journals

Legal Due Diligence: Beware of Credit Assignments

by Raffaele Caso | May 12, 2022 | Blog

The assignment contracts

Credit assignment is the contract by which the creditor (assignor) transfers its right to credit to a third party (assignee), who will collect it from the debtor (assigned).

This is an increasingly common practice, involving not only banking institutions but also commercial companies that, in turn, also assign receivables to their suppliers.

Audits in DD

Right from the Due Diligence (DD) phase aimed at the acquisition of company shares/shares or companies and business units, it is essential to pay attention to the issue of credit assignment and assess whether the payment flow is in accordance with the agreements made, notifications, acceptances and exchange of information carried out between the parties involved. Verification is necessary, among other reasons, to prevent:

• (a) the obligor who has paid erroneously (e.g., payment in favor of the assignor despite notification or acceptance of the assignment) is forced to pay the same amount again in favor of the assignee;
• (b) the assigning creditor collects sums not due to it and, (i) on the one hand, is forced to return the sum to the assignee or the debtor (if the latter has in the meantime repeated the sum in favor of the assignee) and, (ii) on the other hand, may be subject to actions for damages by the debtor and/or the assignee.
• (c) the transferee creditor is forced to “chase” the debtor who has paid erroneously or an assignor creditor who has collected an undue sum.

Verifications must be conducted based on legal regulations.

>>  READ LDP ARTICLES TO STAY UPDATED

It is noted, for example, that:

There are limits to assignment in that credits that are strictly personal in nature, credits whose transfer is prohibited by law or credits whose assignability is expressly excluded by the parties (for example, a specific procedure is provided for the assignment of credits with public administrations) cannot be transferred. It is therefore a good idea to check the nature of the assigned receivable to avoid incurring null and void or ineffective assignment contracts in the recourse assignment mode, the assignor must guarantee that the debtor will perform the due performance. In the event of default, the assignee may turn to the assignor, who in turn is required to pay the amount owed by the debtor.

Therefore, in the presence of this mode of assignment, to ensure full release of the assignor, it will have to be verified that the assigned debtor has paid its debt to the assignee in full.

The assignment of credit is consensual in nature and, therefore, is perfected by the agreement reached between the assignor and assignee, not by acceptance or notification to the assigned debtor.

Therefore, to exclude actions for breach of contract on the part of the assignee, it is appropriate for the assignor himself to give timely notice of the assignment to the assigned debtor.

There is no peremptory deadline for notifying the assigned debtor of the assignment, which can be done in any form suitable for the purpose, even a notice sent by registered mail is sufficient (and even a verbal notice).

The law also does not identify the party required to notify the assignment of the claim. In this regard, it should be remembered that prior to acceptance or notification there is a presumption of good faith on the part of the assigned debtor that it has fulfilled its obligations to the assignor, with the consequence that payment made in favor of the assignor itself is fully dischargeable. The assignee can overcome this presumption by proving, by any means (including witnesses), that the assigned debtor was in any case aware of the assignment.

Therefore, to prevent the assigned debtor from being forced to repeat (in favor of the assignee) the payment already made (in favor of the assignor) it will be necessary not only to evaluate the exchange of written information but also to screen, possibly through targeted interviews with apicals, the verbal information acquired from the assigned debtor. The difficulty of such a verification is well evident; therefore, it would always be advisable to provide written notification of the assignment of credit.

In the presence of credit assignment contracts, it is therefore a good idea to dedicate within the DD check list (aimed at the acquisition of company shares/shares or companies and business units), a specific section referring to credit assignments involving the client company as assignor, assignee, and transferee.

>>  FIND OUT MORE ABOUT LDP SERVICES

Want to know more about ldp services get a coffee with us.

I have read the information on the processing of personal data

Move your business forward. Choose LPD as your trusted Advisor.

Encyclopedia of Machine Learning pp 238–242 Cite as

Credit Assignment

• Claude Sammut  
• Reference work entry

615 Accesses

1 Altmetric

Structural credit assignment ; Temporal credit assignment

When a learning system employs a complex decision process, it must assign credit or blame for the outcomes to each of its decisions. Where it is not possible to directly attribute an individual outcome to each decision, it is necessary to apportion credit and blame between each of the combinations of decisions that contributed to the outcome. We distinguish two cases in the credit assignment problem. Temporal credit assignment refers to the assignment of credit for outcomes to actions. Structural credit assignment refers to the assignment of credit for actions to internal decisions. The first subproblem involves determining when the actions that deserve credit were taken and the second involves assigning credit to the internal structure of actions (Sutton,  1984 ).

Consider the problem of learning to balance a pole that is hinged on a cart (Michie & Chambers,  1968 , Anderson, & Miller, 1991 ). The cart...

This is a preview of subscription content, access via your institution .

Recommended Reading

Albus, J. S. (1975). A new approach to manipulator control: The cerebellar model articulation controller (CMAC). Journal of Dynamic Systems, Measurement and Control, Transactions ASME, 97 (3), 220–227.

MATH   Google Scholar  

Anderson, C. W., & Miller, W. T. (1991). A set of challenging control problems. In W. Miller, R. S. Sutton, & P. J. Werbos (Eds.), Neural Networks for Control . Cambridge: MIT Press.

Google Scholar  

Atkeson, C., Schaal, S., & Moore, A. (1997). Locally weighted learning. AI Review, 11 , 11–73.

Banerjee, B., Liu, Y., & Youngblood, G. M. (Eds.), (2006). Proceedings of the ICML workshop on “Structural knowledge transfer for machine learning .” Pittsburgh, PA.

Barto, A., Sutton, R., & Anderson, C. (1983). Neuron-like adaptive elements that can solve difficult learning control problems. IEEE Transactions on Systems, Man, and Cybernetics , SMC-13, 834–846.

Benson, S., & Nilsson, N. J. (1995). Reacting, planning and learning in an autonomous agent. In K. Furukawa, D. Michie, & S. Muggleton (Eds.), Machine Intelligence 14 . Oxford: Oxford University Press.

Bertsekas, D. P., & Tsitsiklis, J. (1996). Neuro-dynamic programming . Nashua, NH: Athena Scientific.

Caruana, R. (1997). Multitask learning. Machine Learning, 28 , 41–75.

Dejong, G., & Mooney, R. (1986). Explanation-based learning: An alternative view. Machine Learning, 1 , 145–176.

Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning . Boston: Addison-Wesley Longman Publishing.

Grefenstette, J. J. (1988). Credit assignment in rule discovery systems based on genetic algorithms. Machine Learning, 3 (2–3), 225–245.

Hinton, G., Rumelhart, D., & Williams, R. (1985). Learning internal representation by back-propagating errors. In D. Rumelhart, J. McClelland, & T. P. R. Group (Eds.), Parallel distributed computing: Explorations in the microstructure of cognition (Vol. 1., pp. 31–362). Cambridge: MIT Press.

Holland, J. (1986). Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In R. S. Michalski, J. G. Carbonell, & T. M. Mitchell (Eds.), Machine learning: An artificial intelligence approach (Vol. 2). Los Altos: Morgan Kaufmann.

Laird, J. E., Newell, A., & Rosenbloom, P. S. (1987). SOAR: An architecture for general intelligence. Artificial Intelligence, 33 (1), 1–64.

MathSciNet   Google Scholar  

Mahadevan, S. (2009). Learning representation and control in Markov decision processes: New frontiers. Foundations and Trends in Machine Learning, 1 (4), 403–565.

Michie, D., & Chambers, R. (1968). Boxes: An experiment in adaptive control. In E. Dale & D. Michie (Eds.), Machine Intelligence 2 . Edinburgh: Oliver and Boyd.

Minsky, M. (1961). Steps towards artificial intelligence. Proceedings of the IRE, 49 , 8–30.

Mitchell, T. M., Keller, R. M., & Kedar-Cabelli, S. T. (1986). Explanation based generalisation: A unifying view. Machine Learning, 1 , 47–80.

Mitchell, T. M., Utgoff, P. E., & Banerji, R. B. (1983). Learning by experimentation: Acquiring and refining problem-solving heuristics. In R. Michalski, J. Carbonell, & T. Mitchell (Eds.), Machine kearning: An artificial intelligence approach . Palo Alto: Tioga.

Moore, A. W. (1990). Efficient memory-based learning for robot control . Ph.D. Thesis, UCAM-CL-TR-209, Computer Laboratory, University of Cambridge, Cambridge.

Niculescu-mizil, A., & Caruana, R. (2007). Inductive transfer for Bayesian network structure learning. In Proceedings of the 11th International Conference on AI and Statistics ( AISTATS 2007 ). San Juan, Puerto Rico.

Reid, M. D. (2004). Improving rule evaluation using multitask learning. In Proceedings of the 14th International Conference on Inductive Logic Programming (pp. 252–269). Porto, Portugal.

Reid, M. D. (2007). DEFT guessing: Using inductive transfer to improve rule evaluation from limited data . Ph.D. thesis, School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia.

Rosenblatt, F. (1962). Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanics . Washington, DC: Spartan Books.

Samuel, A. (1959). Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 3 (3), 210–229.

Silver, D., Bakir, G., Bennett, K., Caruana, R., Pontil, M., Russell, S., et al. (2005). NIPS workshop on “Inductive transfer: 10 years later”. Whistler, Canada.

Sutton, R. (1984). Temporal credit assignment in reinforcement learning . Ph.D. thesis, Department of Computer and Information Science, University of Massachusetts, Amherst, MA.

Sutton, R., & Barto, A. (1998). Reinforcement learning: An introduction . Cambridge: MIT Press.

Taylor, M. E., & Stone, P. (2009). Transfer learning for reinforcement learning domains: A survey. Journal of Machine Learning Research, 10 , 1633–1685.

Wang, X., Simon, H. A., Lehman, J. F., & Fisher, D. H. (1996). Learning planning operators by observation and practice. In Proceedings of the Second International Conference on AI Planning Systems, AIPS-94 (pp. 335–340). Chicago, IL.

Watkins, C. (1989). Learning with delayed rewards . Ph.D. thesis, Psychology Department, University of Cambridge, Cambridge.

Watkins, C., & Dayan, P. (1992). Q-learning. Machine Learning, 8 (3–4), 279–292.

Download references

Author information

Authors and affiliations.

You can also search for this author in PubMed   Google Scholar

Editor information

Editors and affiliations.

School of Computer Science and Engineering, University of New South Wales, Sydney, Australia, 2052

Claude Sammut

Faculty of Information Technology, Clayton School of Information Technology, Monash University, P.O. Box 63, Victoria, Australia, 3800

Geoffrey I. Webb

Rights and permissions

Reprints and Permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry.

Sammut, C. (2011). Credit Assignment. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30164-8_185

Download citation

DOI : https://doi.org/10.1007/978-0-387-30164-8_185

Publisher Name : Springer, Boston, MA

Print ISBN : 978-0-387-30768-8

Online ISBN : 978-0-387-30164-8

eBook Packages : Computer Science Reference Module Computer Science and Engineering

Share this entry

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

• Find a journal
• Publish with us